title: insertion sort algorithm pseudocode
body: <pre><code>INSERTION-SORT(A)
  1 for j ← 2 to length[A]
  2   do key ← A[j]
  3     ▹ Insert A[j] into the sorted sequence A[1  j - 1].
  4     i ← j - 1
  5     while i &gt; 0 and A[i] &gt; key
  6     do A[i + 1] ← A[i]
  7         i ← i - 1
  8     A[i + 1] ← key
  </code></pre>
  
  <p>Hi! this is my first question.Could anyone help me understand this code? why is it 'A[i+1]=A[i]'? shouldn't this be other way round as we are going down the list.</p>