HeapSort Publisher's description
HeapSort is an implementation of Williams and Floyd classic HeapSort.
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
What's New in This Release:В· bundle with pad and ant scripts
System Requirements:Java 1.5+
Program Release Status: Minor Update
Program Install Support: Install and Uninstall