No. of comparisons: 0 No. of swaps: 0
pos = 0
while(pos < length(list))
if(pos == 0 or
list[pos] >= list[pos-1])
pos++
else
swap(list[pos], list[pos-1])
pos--
SHORT EXPLANATION
------------------
1. Starting at index 1, compare the current element with
the previous element
a. If the current element is greater than the previous
element, move to the next element
b. If the current element is less than the previous element,
swap them and keep moving
that element back until it can't be moved
back any further.
2. Repeat Step 1 until the list is sorted