That heap-sort example is not really lazy. The java.util.concurrent.PriorityBlockingQueue essentially sorts the whole thing, and then the heap-sort is just making a lazy seq over that.
Also, note that the "speed test" at that link is only working with lists of 1000, and the original poster described himself as dealing with large datasets. I doubt these benchmarks will be applicable. On Fri, Sep 16, 2011 at 5:06 PM, Joop Kiefte <iko...@gmail.com> wrote: > Pepijn de Vos had a blogpost about lazy sorts. One of them seems to be a > particularly good fit for this problem: > http://pepijndevos.nl/lazy-sorting/index.html (the heap-sort example seems > the fastest of those for this use-case...). > > -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
