Running time of Strassen’s algorithm is better than the naïve Theta(n^3) method.
(a) True
(b) False
I had been asked this question during an interview.
Origin of the question is Number Theory topic in division Number Theory of Data Structures & Algorithms II