public class BinaryInsertion extends Object
BinaryInsertionclass provides a static method for sorting an array using an optimized binary insertion sort with half exchanges.
In the worst case, this implementation makes ~ n log2n compares to sort an array of length n. However, in the worst case, the running time is Θ(n2) because the number of array accesses can be quadratic. As such, it is not suitable for sorting large arrays (unless the number of inversions is small).
This sorting algorithm is stable. It uses Θ(1) 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; insertion sorts 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