// Sort an array using a simple insertion sort.
public void insertionSort(int[] data) {
    for (int which = 1; which < data.length; ++which) {
        int val = data[which];
        for (int i = 0; i < which; ++i) {
            if (data[i] > val) {
                System.arraycopy(data, i, data, i + 1, which - i);
                data[i] = val;
                break;
            }
        }
    }
}

for i ← 1 to length(A)
    j ← i
    while j > 0 and A[j-1] > A[j]
        swap A[j] and A[j-1]
        j ← j - 1