Insertion Sort pseudocode

Let A a zero-based array with size n

for i from 1 to n - 1 {
    x = A[i]
    j = i
    while j > 0 and A[j-1] > x {
        A[j] = A[j-1]
        j = j - 1
    }
    A[j] = x
}