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 -jar heapsort.jar
VERSION HISTORY
- Version 1.7 posted on 2008-01-01
bundle with pad and ant scripts
Program Details
- Category: Development > Components & Libraries
- Publisher: Canadian Mind Products
- License: Free
- Price: N/A
- Version: 1.7
- Platform: windows