What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?

(A) o(n)
(B) o(n2)
(C) o(n3)
(D) o(n!)

💬 Discuss

✅ Correct Answer: (C) o(n3)

Explanation: the time complexity of recursive multiplication of two square matrices by the divide and conquer method is found to be o(n3) since there are total of 8 recursive calls.

Explanation by: Mr. Dubey

the time complexity of recursive multiplication of two square matrices by the divide and conquer method is found to be o(n3) since there are total of 8 recursive calls.

💬 Discussion

📊 Question Analytics

👁️

184

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

93%

Success Rate