0 votes 0 votes T(n) = 8T( n/ 2 ) + Θ(n^2) The Master Theorem gives us T(n) = Θ(n^3 ) Strassen’s algorithm :- T(n) = 7T( n/2 ) + Θ(n^2) = Θ(n^2.8 ) = (4^2.8) .....aprox 48.50 Algorithms algorithms + – Prateek kumar asked Mar 15, 2017 Prateek kumar 257 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
