public class MergeBU extends Object
MergeBUclass 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.
|Modifier and Type||Method and Description|
Reads in a sequence of strings from standard input; bottom-up mergesorts 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 a)
a- the array to be sorted
public static void main(String args)
args- the command-line arguments