public class MergeBU extends Object
MergeBU
class provides static methods for sorting an
array using bottomup mergesort. It is nonrecursive.
This implementation takes Θ(n log n) time to sort any array of length n (assuming comparisons take constant time). It makes between ~ ½ n log_{2} n and ~ 1 n log_{2} 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.
Modifier and Type  Method and Description 

static void 
main(String[] args)
Reads in a sequence of strings from standard input; bottomup
mergesorts them; and prints them to standard output in ascending order.

static void 
sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order.

public static void sort(Comparable[] a)
a
 the array to be sortedpublic static void main(String[] args)
args
 the commandline arguments