Package edu.princeton.cs.algs4
Class MergeBU
 Object

 edu.princeton.cs.algs4.MergeBU

public class MergeBU extends Object
TheMergeBU
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.
 Author:
 Robert Sedgewick, Kevin Wayne


Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method 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.



Method Detail

sort
public static void sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order. Parameters:
a
 the array to be sorted

main
public 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. Parameters:
args
 the commandline arguments

