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 -jar quicksort.jar
QuickSort is a free software application from the Components & Libraries subcategory, part of the Development category.
The app is currently available in English and it was last updated on 2008-01-01. The program can be installed on Java, Linux, Mac OS X, Unix, Win2000, Win7 x32, Win7 x64, WinServer, WinVista, WinVista x64, WinXP.
QuickSort (version 1.6) has a file size of 77.82 KB and is available for download from our website.
Just click the green Download button above to start. Until now the program was downloaded 1442 times.
We already checked that the download link to be safe, however for your own protection we recommend that you scan the downloaded software with your antivirus.