@Natansh: How do you do this with the constraint that your RAM is so small that you cannot accomodate all of the numbers at once?
Dave On Mar 20, 9:04 am, Natansh Verma <[email protected]> wrote: > There's another way... use the partitioning method for quicksort to find the > k smallest elements. Then it should take expected time as O(n + klogk). > Plus, it is in-place. > > > > On Wed, Mar 16, 2011 at 7:26 PM, asit <[email protected]> wrote: > > I agree with munna > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en.- Hide quoted text - > > - Show quoted text - -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
