Insertion sort

Bubble sort, insertion sort and merge sort can all start with unsorted data. None requires the input list to be sorted beforehand. They do need a way to compare items consistently, so that the algorithm can decide which item comes before another.