Vidyalelo
Data Structure · Q341

Sorting Algorithms

Programming · Data Structure · question 341

Q341

What is the recurrence relation for stooge sort?

A.
T(n) = 2T(2/3n) + O(n)
B.
T(n) = 2T(2/3n) + O(1)
C.
T(n) = 3T(2/3n) + O(n)
D.
T(n) = 3T(2/3n) + O(1)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board