-3

How can you solve the recurrence $$3T(n) = T(n/3)+ \sqrt{\log n}$$ using the master theorem?

I am lost in this question.

Yuval Filmus
  • 280,205
  • 27
  • 317
  • 514
tjbeast
  • 1

1 Answers1

0

Asymptotically, T(n) ≈ sqrt (log (n)) / 2. That's the answer to your question. It's very unlikely that it is the answer to the question you wanted to ask.

I didn't use the master theorem to solve this, but a spreadsheet :-)

gnasher729
  • 32,238
  • 36
  • 56