-1

Master theorem fails so tried recursion tree, variable change, repeating method, etc etc.

I can’t handle the “sum from i = 0 to log3(n) of (2/3)^i * n/((log(n/3^i))^2 “ that occurs:

photoOfSum

Used logarithmic properties to expand, but still a dead end for me.

meowgoesthedog
  • 14,670
  • 4
  • 27
  • 40

1 Answers1

0

According to this page, a logarithm grows more slowly than any polynomial term:

enter image description here

Applying this result to the Master theorem, find that case 3 applies:

enter image description here

Hence the complexity is just

enter image description here

meowgoesthedog
  • 14,670
  • 4
  • 27
  • 40