For matrix multiplication, if we use divide and conquer algorithm, then…
UGC NET 2022
For matrix multiplication, if we use divide and conquer algorithm, then ______.
A. The running time is T(n)=Θ(n³).
B. The running time is T(n)=Θ(n² log n).
C. The recurrence can be defined as T(n)=8T(n/2)+Θ(n²).
D. The recurrence relation is T(n)=8T(2n)+Θ(n² log n).
E. Masters theorem, one of the cases is applicable.
Choose the most appropriate answer from the options given below:
- A.
A, C, E only
- B.
A, D, E only
- C.
B, D, E only
- D.
B, C, D only
Attempted by 8 students.
Sign up free to check your answer
Sign up freeLoading lesson…

