Describe how the number of comparisons used in the worst case changes when the size of the list to be sorted doubles from n to 2n, where n is a positive integer when these sorting algorithms are used. a) The selection sort begins by finding the least element in the list. This element is swapped to the front. Then the least element among the remaining elements is found and swapped into the second position. This procedure is repeated until the entire list has been sorted.
b) The binary insertion sort is a variation of the insertion sort that uses a binary search technique rather than a linear search technique to identify the location to insert the ith element in the correct place among the previously sorted elements.