public class MergeX extends Object
MergeX
class provides static methods for sorting an
array using an optimized version of mergesort.
In the worst case, this implementation takes Θ(n log n) time to sort an array of length n (assuming comparisons take constant time).
This sorting algorithm is stable. It uses Θ(n) extra memory (not including the input array).
For additional documentation, see Section 2.2 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; mergesorts them
(using an optimized version of mergesort);
and prints them to standard output in ascending order.
|
static void |
sort(Comparable[] a)
Rearranges the array in ascending order, using the natural order.
|
static void |
sort(Object[] a,
Comparator comparator)
Rearranges the array in ascending order, using the provided order.
|
public static void sort(Comparable[] a)
a
- the array to be sortedpublic static void sort(Object[] a, Comparator comparator)
a
- the array to be sortedcomparator
- the comparator that defines the total orderpublic static void main(String[] args)
args
- the command-line arguments