Free download QuickSort 1.6
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
QuickSort 1.6 development, components & libraries software developed by Canadian Mind Products. The license of this development, components & libraries software is freeware, the price is 0.00, you can free download and get a free trial before you buy a license or registration. All QuickSort 1.6 download links are direct QuickSort full download from Canadian Mind Products site or their selected mirrors.
Keywords: Java, QuickSort, sort, Hoare, array sort, Freeware, Development, Components & Libraries, Canadian Mind Products, QuickSort
Recent Changes: bundle with pad and ant scripts
Install Support: No Install Support
Supported Languages: English
Additional Requirements: Java 1.5+
|