Consider a revised selection sort algorithm so that on each pass it finds both the largest and smallest values in the unsorted portion of the array. The sort then moves each of these values into its correct location by swapping array entries.

a. How many comparisons are necessary to sort n values?

b. Is the answer to Part a greater than, less than, or equal to the number of comparisons required by the original version of selection sort?

A bubble sort can sort an array of n entries into ascending order by making n – 1 passes through the array. On each pass, it compares adjacent entries and swaps them if they are out of order. For example, on the first pass, it compares the first and second entries, then the second and third entries, and so on. At the end of the first pass, the largest entry is in its proper position at the end of the array. We say that it has bubbled to its correct spot. Each subsequent pass ignores the entries at the end of the array, since they are sorted and are larger than any of the remaining entries. Thus, each pass makes one fewer comparison than the previous pass. Figure 8-17 gives an example of a bubble sort. Implement the bubble sort

a. Iteratively

b. Recursively