7: Matching: Select the sorting algorithm that best matches the description. [Choose ] Iterated insertion sort with decreasing gap size "g" (increment to skip by when inserting into sorted sublist), after iteration with gap size "g" there are "g" interleaved sorted sublists Choose Heapsort Radix Sort Shell Sort Bubble Sort Counting Sort Selection Sort Insertion Sort Quicksort Bucket Sort Merge Sort Pick pivot value, all pivot to right of pivot, then recurse [Choose ] Left of current position is sorted, current item walks back until in proper place [Choose ] Uses same principle as selection sort but has O(n*log(n)) runtime Divide in half (recurse until small), sort by combining sorted halves [ Choose ] [Choose ] Sorts values by sorting according to each digit of the value in order starting from either least significant or most significant digit [Choose ] Assign each value to a group with each group only containing values within a certain range then sort the values in each of these groups. Afterwards collect each group of values in order Left of current position is sorted, linear search for next smallest [Choose ]