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
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 -
Its ceiling so it will not always be zero. basically ceil(log_2(c)) gives
the no. of bits of C.
eg: C = 7 then ceil(log_2(c)) = 3 so | c - 2^ceil(log_2(c)) | = | 7-2^3|
= 1
On Wed, Jun 4, 2008 at 2:31 PM, Nat Padmanabhan [EMAIL PROTECTED]
wrote:
looks like | c - 2^ceil(log_2(c)) | will be
Thanks much for all the responses. I have a good idea now as to how to go
about this.
Best,
Vasant
On Mon, Jun 2, 2008 at 4:59 PM, Vasant [EMAIL PROTECTED] wrote:
Greetings!
As the subject line specifies, am trying to compute the area of
overlap between two rectangles that can have any
