Insertion sort - pseudocode question?

It looks like the first pseudocode block used 1 based indexing while the second uses 0 based indexing.

It's basically the same thing, just that one's index starts at 0 (zero-based) and the other's at 1 (one-based). E.g. In C#'s arrays are zero-based, while VB's are one-based.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.