Question

Suppose that we used the randomized selection algorithm to find the minimum element, with the modification that if we chose the maximum number as our partition element, we put that number into the set H. Suppose that our input was (5, 8, 1, 3, 4, 2, 6, 7). Which sequence of partition elements would result in the largest running time?​

Answer 1

Answer:

8,7,6,5,4,3,2,1

Explanation: