DotNetKicks.com - Stories tagged with Algorithms

Quicksort and Binary Search algorithms in C++

Wed, 21 May 2008 21:18:56 GMT

This is about a paper entitled Quicksort and Binary Search Algorithms. A fantastic subject that is used throughout the the computer science filed. In the paper you'll see the intrinsic nature of each algorithm as well as a functional implementation of such algorithms in the C++ programming language. Both algorithms perform well in huge data sets.

How to break quicksort

Fri, 09 May 2008 08:04:15 GMT

Quicksort usually runs in O(N log N) time, but in special cases, it takes much longer: O(N^2). It is surprisingly easy to force any quicksort implementation to degrade into the quadratic-time behavior. This trick even works against a randomized quicksort! The article demonstrates how the trick works by applying it against the BCL Array.Sort() routine.

C# object arrays BinarySearch, Sort and IComparer

Thu, 07 Sep 2006 17:01:01 GMT

Looking at some basic examples to getting some decent features of object arrays working in .net 1.1

Generalizing the algorithm

Wed, 16 Aug 2006 03:31:02 GMT

One of the common tasks developers face on a regular basis is generalizing an algorithm. This How-To describes how a combination of Extract Method and Push Members Down refactorings can help you streamline this task.