public class InsertionX extends Object
InsertionX
class provides static methods for sorting
an array using an optimized version of insertion sort (with half exchanges
and a sentinel).
In the worst case, this implementation makes ~ 1/2 n^{2} compares to sort an array of length n. So, 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 

static void 
main(String[] args)
Reads in a sequence of strings from standard input; insertion sorts 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.

public static void sort(Comparable[] a)
a
 the array to be sortedpublic static void main(String[] args)
args
 the commandline arguments