1. insertion sort A sorting algorithm that inserts each item in the proper place into an initially empty list by comparing it with each item in the list until it finds the new elements successor or the end of the list. Compare bubble sort.
insertion sort |
