A

Admin • 828.03K Points
Coach

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!)
Explanation by: Admin
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.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.