InsertionSort.java

package sorting_searching;

import java.util.Comparator;

public class InsertionSort {

    public static void main(String[] args) {
        // Example:
        int[] array = {91, 34, 86, 39, 27, 87, 70, 48, 100, 95};
        insertionSort(array);
        System.out.println(java.util.Arrays.toString(array));  // [27, 34, 39, 48, 70, 86, 87, 91, 95, 100]
    }

    public static void insertionSort(int[] a) {
        for (int i = 1; i < a.length; ++i) {
            int k = -(BinarySearch.binarySearchIterative(a, a[i], 0, i - 1) + 1);
            int temp = a[i];
            System.arraycopy(a, k, a, k + 1, i - k);
            a[k] = temp;
        }
    }

    public static <T extends Comparable<? super T>> void insertionSort(T[] a) {
        insertionSort(a, Comparator.naturalOrder());
    }

    public static <T> void insertionSort(T[] a, Comparator<T> comp) {
        for (int i = 1; i < a.length; ++i) {
            int k = -(BinarySearch.binarySearchIterative(a, a[i], comp, 0, i - 1) + 1);
            T temp = a[i];
            System.arraycopy(a, k, a, k + 1, i - k);
            a[k] = temp;
        }
    }

}