What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
|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.|
Login to Continue
It will take less than 2 minutes