Insertion Sort Algorithm

This is the Insertion Sort Algorithm.

The pseudo-code for this algorithm is as follows:
InsertionSort(A, start, end):
     for (i = start to end)
          val <- A[i]
          j <- i

          while (A[j - 1] > val)
               A[j] <- A[j-1]
               j <- j - 1
          end while

          A[j] <- val
     end for
end InsertionSort



Show Work?