InsertionSort.java

public class InsertionSort {

    public static void insertionSort(int[] arr) {
        final int length = arr.length;
        for (int i = 1; i < length; i++) {
            final int key = arr[i];
            int position = i;

            while (position > 0 && key < arr[position - 1]) {
                arr[position] = arr[position - 1];
                position--;
            }

            arr[position] = key;
        }
    }

}