A friend asked me this question ...
Also asked me another modification ,
T(n) = T[ *mod*(n-2^( ceil(log n) )) ] +O(n)
Can we find the complexity for such a recurrence ?
On Mon, Sep 15, 2008 at 9:17 AM, Ashesh [EMAIL PROTECTED] wrote:
You should agree with the fact that log(n-1) =
The simplest way of computing the time complexity
--~--~-~--~~~---~--~~
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
