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.
» version 1.6 - posted on 2008-01-01
bundle with pad and ant scripts
This program is for non-military use only.
For details on what that licencing restriction means and why I restricted this software that way, see http://mindprod.com/contact/nonmil.html
If you incorporate any of my code in your programs, they too must be marked for non-military use only.
However it is not your responsibility to enforce that restriction.
HeapSort FREE HeapSort is an implementation of Williams and Floyd's TopDown HeapSort. HeapSort is a fast internal sort written in Java that uses a sorting algorithm analogous to power struggles for higher positions in a hierarchical bureaucracy. Source provided. It is faster than QuickSort, but slower that... Download
RadixSort FREE RadixSort is a fast internal sort written in Java that mimics a card sorter. Source provided. It is faster than both HeapSort and QuickSort. It sorts using a comparision routine you provide to compare two elements to be sorted plus a method to extract individual bytes from the keys to be sorted.... Download