hi guys
i can't solve this problem
is there any hint???
T(n) = T(n/2 + √n) + √6046
your help will be appreciated
RehabReda 0 Light Poster
BestJewSinceJC 700 Posting Maven
I would make a guess and then try the substitution method. I'm not very good with recurrences though so use this advice at your own risk (of failure). But the guess I'd make first would take into consideration that for large n, n/2 + root n is controlled by n/2. That square root at the end of the recurrence doesn't matter, I don't think, because it's a constant. After you make the guess though, you substitute and see if it works, so even if your logic sucks, as mine might have, as long as you can do algebra, it doesn't matter.
Rashakil Fol 978 Super Senior Demiposter Team Colleague
The Akra-Bazzi theorem ( http://en.wikipedia.org/wiki/Akra-Bazzi_method ) applies in this case because sqrt(n) is O(n/log(n)^2) so you can just use the Master theorem. So BestJewSinceJC's intuition is correct.
anollipian -2 Newbie Poster
Try Substitution :P
Rashakil Fol commented: WTF does that even mean -1
BestJewSinceJC commented: plus i already said that, with a better explanation -1
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.