Vidyalelo
Data Structure · Q802

Miscellaneous on Data Structures

Programming · Data Structure · question 802

Q802

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

A.
O(n)
B.
O(n2)
C.
O(n3)
Answer
D.
O(n!)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board