Under what case of Master’s theorem will the recurrence relation of stooge sort fall?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. Under what case of Master’s theorem will the recurrence relation of stooge sort fall?

(A) 1
(B) 2
(C) 3
(D) it cannot be solved using master’s theorem

💬 Discuss

✅ Correct 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.

Explanation by: Mr. Dubey

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.

💬 Discussion

📊 Question Analytics

👁️

422

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate