Insertion sort: On each pass, one for each item 1 through n1, the current item is checked against those in the already sorted sub-list. As we look back into the already sorted sub list, we shift those items that are greater to the right. When we reach a smaller item or the end of the sub-list, the current item can be inserted. How does the following array look after third insertion? [54,26,93,17,77,31,44,55,20]