Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting (

Question

TuteeHUB · Accepted Answer

T(𝑛) = 2T(𝑛 – 1) + 𝑐n

TuteeHUB · Answer

T(𝑛) = 2 T(𝑛/2) + 𝑐n

TuteeHUB · Answer

T(𝑛) = T(𝑛 – 1) + T(1) + 𝑐n

TuteeHUB · Answer

T(𝑛) = T(𝑛/2) + 𝑐n

1.	Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting (
A.	T(𝑛) = 2 T(𝑛/2) + 𝑐n
B.	T(𝑛) = T(𝑛 – 1) + T(1) + 𝑐n
C.	T(𝑛) = 2T(𝑛 – 1) + 𝑐n
D.	T(𝑛) = T(𝑛/2) + 𝑐n
Answer» C. T(𝑛) = 2T(𝑛 – 1) + 𝑐n

Discussion