[algogeeks] Re: Algorithmic challenge?

the link is not working http:// ilpubs.stanford.edu:8090/750/1/2003-29.pdf 2009/5/6 UKuser > > As per my previous post, is there anybody who can explain section 3 to > me from the PDF mentioned in this link: > http://groups.google.com/group/algogeeks/t/6ccc544529b01d10 > > Any help would be grea

[algogeeks] Scholarships in UK for International Students

Dear Friends Following excellent scholarships are available in UK Six Overseas PhD Scholarships - Computer Science http://www.scholarships-links.com/viewdetail/id/441/Six-Overseas-PhD-Scholarships---Computer-Science.html Variuos Scholarships for International students at University of Westmeni

[algogeeks] Re: find k-th smallest element in the set of combined m+n elements

On Apr 30, 12:27 pm, Saurabh wrote: > Two sorted sequences of size m and n are given. Write an efficient > algo to find k-th smallest element in the set of combined m+n > elements. Note that the best possible algorithm runs in O(log(max > (m,n))). I will give a sketch of the main algorithm. Det

[algogeeks] Algorithmic challenge?

As per my previous post, is there anybody who can explain section 3 to me from the PDF mentioned in this link: http://groups.google.com/group/algogeeks/t/6ccc544529b01d10 Any help would be great. A --~--~-~--~~~---~--~~ You received this message because you are s