[algogeeks] Re: generating a random number having uniform distribution using random coin flips

You're right, thanks On Sat, Apr 19, 2008 at 4:07 PM, deeepanshu shukla <[EMAIL PROTECTED]> wrote: > see Random[0,1] gives o with probability 1/2 and 1 with prob. 1/2 so when > u generate t=lg(b-a+1) bits by calling it gives any number between 0 and > 2^t-1 = (b-a) with probability > 1/2^

[algogeeks] Simple Way to Make Money Online

Simple Way to Make Money Online Visit : http://mmeazy.blogspot.com . --~--~-~--~~~---~--~~ 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 unsub

[algogeeks] Chinese remainder theorem

Hi All, I am having hard time with this theorem as defined in "Introduction to Algorithms" by Cormen ... I've read the Chinese Remainder theorem in other books and it is clear, but Cormen tells something different, they talk about Cartesian product, descriptive structure etc. If anyone un

[algogeeks] Analysisi of median sort.......

hello everybody , this is exercise 7-5 of CLRS i just need to match my answers . can anyone help me One way to improve the RANDOMIZED-QUICKSORT procedure is to partition around a pivot that is chosen more carefully than by picking a random element from the subarray. One common approa