Sorting Algorithms

We all know that Quicksort is one of the fastest algorithms for sorting. It’s not often, however, that we get a chance to see exactly how fast Quicksort really is. The following applets chart the progress of several common sorting algorithms while sorting an array of data using in-place algorithms. This means that the algorithms do not allocate additional storage to hold temporary results: they sort the data in place. (This is inspired by the algorithm animation work at Brown University and the video Sorting out Sorting By Ronald Baecker from the University of Toronto (circa 1970!).)

Some of these sorts are very stupid or very slow and should not be used in code. The use of Bubblesort is deprecated. So don’t use Bubblesort! Also, don’t use Swapsort! It is only a demonstration of the amount of time Java takes to swap n elements.

In-Place Mergesort is yet another abomination. Mergesort is supposed to run in O(n log n), but the implementation here runs in O(n * n). This is because a temporary scratch array is not used. As with most of the examples here, In-Place Mergesort sorts the elements in the array without using additional storage (other than the stack used for the recursive calls, and temporary variables). Jack Snoeyink has provided me with a the Double Storage mergesort algorithm sort implementation that uses a scratch array.

New: Radix sort by Alvin Raj, August 13, 2002.

Click on each applet to see the algorithm run. Click on the name of the algorithm to see the source.

Link:

http://www.cs.ubc.ca/%7Eharrison/Java/sorting-demo.html
http://cg.scs.carleton.ca/%7Emorin/misc/sortalg/

Post a Comment

Required fields are marked *

*
*

%d bloggers like this: