Analysis And Design Of Algorithms

Question 23 Not yet answered Consider the Quick sort algorithm which sorts elements in ascending order using the first element as pivot. Then which of the following input sequence will require a maximum number of comparisons when this algorithm is applied on it? Marked out of 1.00 Flag question Select one: O a. 52 25 76 67 89 O b. 52 25 89 67 76 O c. 22 25 56 67 89 O d. 22 25 76 67 50