PA of Algorithms Q108

108Let P be a quicksort program to sort numbers in ascending order using the first element as the pivot. Let t₁ and t₂ be the number of comparisons made by Pfor the inputs [1 2 3 4 5] and [4 1 5 3 2] respectively. Which one of the following holds?

Option : C
Explanation :
When first element or last element is chosen as pivot, Quick Sort‘s worst case occurs for the sorted arrays.
In every step of quick sort, numbers are divided as per the following recurrence.
T(n) = T(n-1) + O(n)

Forgot your password?

I agree with the Terms.