Tag: divide and conquer strategy algorithm

Divide & Conquer (Algorithm Design Techniques) (Wait: correct: for a=1,b=2, n^{log_b a}=n^0=1; f(n)=n which is polynomially larger → case 3?

Continue reading