QuickSort 1.6

QuickSort - QuickSort is an in-memory recursive sort

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 is licensed as Freeware for the Windows operating system / platform. QuickSort is provided as a free download for all software users (Freeware).

No reviews yet, be the first to add a review and we'll give you some extra points.

QuickSort is periodically updated by FileCluster but you may encounter situations when the software informations are slightly out-of-date, the producers of QuickSort can modify the product without notifying us. QuickSort 1.6 is currently the last updated version of the software. All rights for QuickSort are belong to the developer, Canadian Mind Products.

Any form of support or software problems regarding QuickSort will be addressd to its developers. Please be aware that we do NOT provide QuickSort cracks, serial numbers, registration codes or any forms of pirated software downloads.