On Thu, Jun 5, 2008 at 10:25 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 ?
This looks to be slightly off-topic, and would probably be more on-topic on a maths-related forum. Have you looked at http://en.wikipedia.org/wiki/Recurrence_relation ? It would indicate either using some form of recursion, or finding an equivilant formula that doesn't rely on recursion. -- PJH 'Two Dead in Baghdad' not 'product-friendly' - Kent Ertugrul, chief executive of Phorm. http://shabbleland.myminicity.com/
