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 RadixSort. It
sorts using a comparison routine you provide to compare two
elements to be sorted.
You can test it with:
java.exe com.mindprod.heapsort.TestHeapSort
