insertion sort insertion sort is somewhat interesting algorithm with an expensive runtime of ( it can be best thought of as sorting scheme similar to that of sorting hand of playing cardsi you take one card and then look at the rest with the intent of building up an ordered set of cards in your hand figure insertion sort iterations algorithm insertionsort(list prelist postlist has been sorted into values of ascending order unsorted while unsorted list count hold list[unsorted unsorted while > and hold list[ list[ list[ - - end while list[ hold unsorted unsorted end while return list end insertionsort