public class BinaryInsertion extends Object
BinaryInsertionclass provides a static method for sorting an array using an optimized binary insertion sort with half exchanges.
This implementation makes ~ n lg n compares for any array of length n. However, in the worst case, the running time is quadratic because the number of array accesses can be proportional to n^2 (e.g, if the array is reverse sorted). As such, it is not suitable for sorting large arrays (unless the number of inversions is small).
The sorting algorithm is stable and uses O(1) extra memory.
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