QuickSort 1.6

Source:Canadian Mind Products

QuickSort is an implementation of Tony Hoare's classic
QuickSort. QuickSort works by choosing a pivot point and
ensuring all elements below the pivot point are small all
above are big, (i.e. smaller than the pivot) Then it
recursively splites the upper and lower halves, repeating
the process. QuickSort is an internal sort written in Java.
Both RadixSort and HeapSort are quicker than QuickSort.
QuickSort can also take pathologically long times if there
is too much pre-existing order in the items to be sorted.
This code is primarily for teaching purposes. It sorts using
a routine you provide to compare two elements to be sorted.

You can test it with
java.exe com.mindprod.quicksort.TestQuickSort

Last Updated:2009-12-17 00:00:00
File size:0.73MB
Screenshot:Not Available
OS:Java, Linux, Mac OS X, Unix, Win2000, Win7 x32, Win7 x64, WinServer, WinVista, WinVista x64, WinXP

Related Downloads