Quick practice
Question 1 of 5
What is recurrence relation for the worst case of Quicksort and time complexity in the Worst case of Quick Sort respectively?
A
T(n) = T(n-2) + O(1) and O(n2)
B
T(n) = T(n/10) + T(9n/10) + O(n) and O(n logn)
C
T(n) = T(n-1) + O(n) and O(n2)
D
T(n) = 2T(n/2) + O(n) and O(n logn)
Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go