Class Heap

  • public class Heap
    extends Object
    The Heap class 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.

    Robert Sedgewick, Kevin Wayne
    • Method Detail

      • sort

        public static void sort​(Comparable[] pq)
        Rearranges the array in ascending order, using the natural order.
        pq - the array to be sorted
      • main

        public static void main​(String[] args)
        Reads in a sequence of strings from standard input; heapsorts them; and prints them to standard output in ascending order.
        args - the command-line arguments