Q283
What will be the recurrence relation of the code of recursive bubble sort?
A.
T(n) = 2T(n/2) + n
B.
T(n) = 2T(n/2) + c
C.
T(n) = T(n-1) + n
AnswerD.
T(n) = T(n-1) + c
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board