Which of the following is the correct recurrence relation for Strassen\’s matrix algorithm?

(A) T(n) = 8T(n/2) + 4(n/2)²
(B) T(n) = 8T(n/2) + 18(n/2)²
(C) T(n) = 7T(n/2) + 18(n/2)²
(D) T(n) = 7T(n/2) + 4.5*(n/2)²


Answer: (C)

Explanation: According to Strassen\’s matrix algorithm recurrence relation for matrix:

T(n) = 7T(n/2) + 18x(n/2)2 
T(n) = 7T(n/2) + 4.5xn2 

Where, 7 – number of multiplications for (n/2) size matrix,
18 – scalar additions/subtractions for (n/2)x(n/2) matrices.

So, option (C) is correct.

Quiz of this Question