Java implementation binary sorting algorithm

Binary insertion sorting method, also known as the binary insertion sorting method, is directly inserted in the order of the improved version, but also the need to perform i-1, the difference is that the first-pass insertion, find out the position of the i+1 element should be inserted, assuming that the first data is already in an orderly state.

The binary insertion sort (binary insertion sort) is an improvement to the insertion sorting algorithm, which, because of the sequencing algorithm, inserts the elements sequentially into the sequence that is already sorted. Since the first half of the sequence is already ordered, we do not need to find the insertion point sequentially, and we can use the binary lookup method to speed up the search for the insertion point. From Codego.net Source Reference

Java implementation binary sorting algorithm