I am really sorry for being a bit of the topic but I thought there are so many good programmers around here with great knowledge of algorithms so some one might help. I have tried many algorithm books for the recurrence relation but didnt find anything useful.
Thanks anyways, Ajinkya ----- Original Message ---- From: Paul Herring <[EMAIL PROTECTED]> To: [email protected] Sent: Thursday, 5 June, 2008 9:31:45 AM Subject: Re: [c-prog] recurrence equation On Thu, Jun 5, 2008 at 10:25 AM, Ajinkya Kale <ajinkyakale_ [EMAIL PROTECTED] com> 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/ Bring your gang together. Do your thing. Find your favourite Yahoo! group at http://in.promos.yahoo.com/groups/ [Non-text portions of this message have been removed]
