Description:
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.
Screen Shot

Keywords:
Java, HeapSort, sort, Williams and Floyd, TopDown HeapSort