Vidyalelo
Data Structure · Q63

Sorting Algorithms

Programming · Data Structure · question 63

Q63

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?

A.
22 25 56 67 89
Answer
B.
52 25 76 67 89
C.
22 25 76 67 50
D.
52 25 89 67 76

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board