Programming Project: Iterative List Merge Sort

Insertion sort keeps growing a sorted list at the front of the list, repeatedly sliding the next unsorted value into our sorted portion until it fits. It performs a bit better than bubble sort. Next we considered merge sort, a divide-and-conquer algorithm, which can easily be … ................
................