How can you solve the recurrence $$3T(n) = T(n/3)+ \sqrt{\log n}$$ using the master theorem?
I am lost in this question.
Asked
Active
Viewed 67 times
-3
-
2you risk this question being closed due to 1) looking like a homework or test question, 2) showing no attempt to arrive at an answer the apparent dead-end of the failed attempt which leaves you perplexed, 3) not itemizing which terms in the given problem make little or no sense to you, and 4) your low-reputation number. While you still have time, please correct at least #1 and #2 on this list, otherwise some moderator will close it for these & other good reasons. Only you can salvage this question prior to it getting closed. – Andreas ZUERCHER Feb 16 '22 at 17:21
-
Does this answer your question? Solving or approximating recurrence relations for sequences of numbers – xskxzr Feb 17 '22 at 01:57
-
@AndreasZUERCHER, if you read the question carefully, it is actually quite funny and educational. Admittedly not intentionally. – gnasher729 Feb 18 '22 at 08:47
1 Answers
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
- 29,996
- 34
- 54