Lists in Python — Question 21

In insertion sort, for each pass, the correct position for the current element is found by comparing adjacent elements before the current position and sliding larger elements up until an element less than the current element is found.