[algogeeks] Inmobi Placement Paper
Hi friends http://www.iitplacementpapers.com/2012/09/inmobi-previous-placment-papers.html -- With Regards, N.Vamshi Vijay, Mtech,CSE, IIT Kharagpur, Software Developer, Amazon India Development Center. --
[algogeeks] Re: Inmobi Placement Paper
@Vamshi: The first answer should be min heap, not max heap. The reason is that you want to know what the smallest of the ten largest numbers you've found so far. So the algorithm is to place the first 10 numbers into the min heap. For each additional number x, if x is greater than the root of