Yes, please. Sent from my Verizon Wireless BlackBerry -----Original Message----- From: Sinan BAKIR <sinanba...@gmail.com>
Date: Thu, 30 Apr 2009 18:40:22 To: <algogeeks@googlegroups.com> Subject: [algogeeks] Re: find k-th smallest element in the set of combined m+n elements what do you mean by combine? will the combined set going to be sorted as well ? 2009/4/30 Saurabh <saurabh...@gmail.com> > > 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))). > > > -- Sinan --~--~---------~--~----~------------~-------~--~----~ 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 unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
