Insertion Sort: Average I
Assume: When a key is moved by the While loop, all positions are equally likely.
There are i positions (i is loop variable of for loop) (Probability of each: 1/i.)
One comparison is needed to leave the key in its present position.
Two comparisons are needed to move key over one position.