Page 1 of 1
The complexity of the matrix multiplication algorithm using the divide and conquer strategy is log(n) because: cross out
Posted: Sat Feb 19, 2022 3:20 pm
by answerhappygod
- The Complexity Of The Matrix Multiplication Algorithm Using The Divide And Conquer Strategy Is Log N Because Cross Out 1 (25.91 KiB) Viewed 30 times
The complexity of the matrix multiplication algorithm using the divide and conquer strategy is log(n) because: cross out CROSS Out O a. We generate a tree of multiplication O b. The number of times we need to divide n by 2 to get 1 is log (n) Oc. We divide and multiply n times O d. We only consider the top right corner of the matrix CROSS out cross out