Hi, I need help for these two equations: 1) For the first one I need an asymptotic solution: T(1)=T(2)=1, T(n) = T( ceil( n/log(n) ) ) + 1 , n>=3
I think it should be O(log(n)), but I don't know how to prove it. 2) I need *the exact* (closed form) solution for this one: T(1)=2 (T(0)=1) T(n)=4T(floor(n/3)) + 3n - 5 I have found a solution for the case when n is a power of 3, but it obviously doesn't work for the general case. I just don't know what to do with this floor function.The solution, I think, should be asymptoticaly equal to theta( n^(log3(4) ), since it is so for the case of n=3^k (k-natural number). --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
