An insertion sort is less complex and efficient than a merge sort, but more efficient than a bubble sort. An insertion sort compares values in turn, starting with the second value in the list. If this ...