Class MergeBU

  • public class MergeBU
    extends Object
    The MergeBU class provides static methods for sorting an array using bottom-up mergesort. It is non-recursive.

    This implementation takes Θ(n log n) time to sort any array of length n (assuming comparisons take constant time). It makes between ~ ½ n log2 n and ~ 1 n log2 n compares.

    This sorting algorithm is stable. It uses Θ(n) extra memory (not including the input array).

    For additional documentation, see Section 2.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

    Robert Sedgewick, Kevin Wayne
    • Method Detail

      • sort

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

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