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...

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 them with other 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?