public class Heap extends Object
Heapclass provides a static method to sort an array using heapsort.
This implementation takes Θ(n log n) time to sort any array of length n (assuming comparisons take constant time). It makes at most 2 n log2 n compares.
This sorting algorithm is not stable. It uses Θ(1) extra memory (not including the input array).
For additional documentation, see Section 2.4 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
|Modifier and Type||Method and Description|
Reads in a sequence of strings from standard input; heapsorts them; and prints them to standard output in ascending order.
Rearranges the array in ascending order, using the natural order.
public static void sort(Comparable pq)
pq- the array to be sorted
public static void main(String args)
args- the command-line arguments