Q1001
What is the recurrence relation used in Strassen's algorithm?
A.
7T(n/2) + Theta(n2)
AnswerB.
8T(n/2) + Theta(n2)
C.
7T(n/2) + O(n2)
D.
8T(n/2) + O(n2)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board