GATE CSE 2015 SET 1 Q ||Algorithms || GATE Insights Version: CSE
Planning to take coaching on https://unacademy.com/
here is a code for 10% off PLUS1BPK1
Telegram Notification Group link:-
https://t.me/joinchat/X5egW_cvdt9kMGY1
Telegram discussion Group link:-
https://t.me/joinchat/VCyGUmVq8RNkMzhl
Downloads resources from here
https://education4fun.com/gate-cse/
MCQ (Single Correct Answer)
GATE CSE 2015 Set 1
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options below, c is a constant.
A) T(n) = 2T (n/2) + cnB) T(n) = T(n – 1) + T(0) + cnC) T(n) = 2T (n – 2) + cnD) T(n) = T(n/2) + cn