public class InsertionSort
{
    private void insert(int[] array, int length, int value)
    {
        int i = length-1;
        while (i >= 0 && array[i] > value) {
            array[i+1] = array[i];
            i--;
        }
        array[i+1] = value;
    }

    public void insertionSort(int[] array, int length)
    {
        int i = 1;
        while (i < length) {
            insert(array, i, array[i]);
            i++;
        }
    }
}