[algogeeks] Google Question

Assume you are writing number in ascending order to an array of constant size.once you reach the end of the array,you start writing from the beginning, thus writing over the oldest entries.Write an algorithm for finding a specific number in this array. -- You received this message because you are

[algogeeks] Randomized Algorithm puzzle(coupon collector problem)

*Hi all,* *Can someone help me to solve this randomized algorithm related puzzle?* * * *Let p(t) = Probability (atmost k copies of coupon1 are collected at **time t)* *If p(t)<= (1/2n), then prove that the expected time to get k+1 copies **of all n coupons <=2t.* -- You received this message beca

[algogeeks] Coupon collector problem(Randomized algorithm problem)

Hi all, Can someone help me to solve this randomized algorithm related puzzle? Let p(t) = Probability (atmost k copies of coupon1 are collected at time t) If p(t)<= (1/2n), then prove that the expected time to get k+1 copies of all n coupons <=2t. With regards, Sugi -- You received this mes

[algogeeks]

can u help with the solution for this problem.?? You’re doing some stress-testing on various models of glass jars to determine the height from which they can be dropped and still not break. The setup for this experiment, on a particular type of jar, is as follows. You have a ladder with n rungs, a