Under what case of Master’s theorem will the recurrence relation of stooge sort fall?
|D.||it cannot be solved using master’s theorem|
|Answer» A. 1|
|Explanation: the recurrence relation of stooge sort is given as t(n) = 3t(2/3n) + o(1). it is found too be equal to o(n2.7) using master’s theorem first case.|
Login to Continue
It will take less than 2 minutes