Toss-ups

[10] This sort takes each element and puts it into the correct spot in the final list. Answer: Insertion Sort [10] The most efficient algorithm for large lists, this sort splits the list into 2 halves, based on whether each element is larger or smaller than a pivot element. This is recursively repeated until the list is in order. Answer: Quick ... ................
................