in reply to Re^4: Better mousetrap (getting top N values from list X)
in thread Better mousetrap (getting top N values from list X)

You can do lazy heap/merge/quick sorts.

-- All code is 100% tested and functional unless otherwise noted.
  • Comment on Re^5: Better mousetrap (getting top N values from list X)

Replies are listed 'Best First'.
Re^6: Better mousetrap (getting top N values from list X)
by BrowserUk (Patriarch) on Feb 03, 2005 at 23:22 UTC

    True, but you still need the whole list for the first pass.

    Examine what is said, not who speaks.
    Silence betokens consent.
    Love the truth but pardon error.
[reply]
      So?

      -- All code is 100% tested and functional unless otherwise noted.
[reply]

        So,...you said:

        ...if you had lazy lists (coming in perl6)...

        And I couldn't see how lazy lists would benefit this problem; hence my original question (way back up there^^^ somewhere).

        Examine what is said, not who speaks.
        Silence betokens consent.
        Love the truth but pardon error.
[reply]

In Section Seekers of Perl Wisdom