Insertion sort algorithm

InsertionSort.java

void insertionSort(int[] array)
{
    for (int i = 1; i < array.length; i++)
    {
        int index = i, indexValue = array[index];

        while (index > 0 && array[index - 1] > indexValue) array[index] = array[--index];

        array[index] = indexValue;
    }
}