@dave -was this a constraint since the beginning? In case it was, I am sorry I didn't notice.
In that case, the heap method ought to work better. I dont think the quicksort method will work. Sent from my iPhone On 20-Mar-2011, at 23:00, Dave <dave_and_da...@juno.com> wrote: > @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 <natansh.ve...@gmail.com> 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 <lipu...@gmail.com> 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 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?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 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?hl=en. > -- 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?hl=en.
