in Algorithms
303 views
1 vote
1 vote

A student develops a technique to multiply
two 2×2 matrices. The technique requires six
multiplications. The complexity of the module that
combines the module is O(n2). Then the recursive
equation depicting the complexity of the algorithm is

(A) T(n) = 6T(n/3) + O(n2)

(B) T(n) = 6T(n/2) + O(n2)

(C) T(n) = 6T(2n ) + O(n2)

(D) T(n) = T(n/2) + 6 O(n2)

in Algorithms
303 views

3 Comments

Check the question and options again...
0
0

Answer Should be A

Using master's theorem it falls in first catagory which will eventually evaluate to O(n2)

0
0

 Abhishek_g why not D.

0
0

Please log in or register to answer this question.