Q. 7 T (n/2) + 1/n

(A) t(n) = o(n)
(B) t(n) = o(log n)
(C) t(n) = o(n2log n)
(D) cannot be solved using master’s theorem

💬 Discuss

✅ Correct Answer: (D) cannot be solved using master’s theorem

Explanation: the given recurrence cannot be solved by using the master’s theorem. it is because in this recurrence relation a < 1 so master’s theorem cannot be applied.

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the given recurrence cannot be solved by using the master’s theorem. it is because in this recurrence relation a < 1 so master’s theorem cannot be applied.

💬 Discussion

📊 Question Analytics

👁️

791

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate

Q. 7 T (n/2) + 1/n

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics