Insertion Sort Understanding (Pseudocode)

Pseudocode of Insertion Sort.  Following TCRC convention,

for j = 2 to N
   key = A[j]
   i = j-1
   while i > 0 and A[i] >key
      A[i+1] = A[i]
      i = i-1
   A[i+1] = key

33_P