looks like | c - 2^ceil(log_2(c)) | will be 0 if log is base 2. Obviously I am missing something, could you throw some light on that expression?
On Wed, Jun 4, 2008 at 10:26 AM, Ajinkya Kale <[EMAIL PROTECTED]> wrote: > How do we solve recurrence relations of the form: > > T(c) = T( | c - 2^ceil(log_2(c)) | ) + O( 2^ceil(log_2c) ) > > What will be the approximate outcome of this equation if not exact ? > > -- > Ciao, > Ajinkya > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
