Wow, you're right. The partial laziness of his code was foiling my benchmark.
-Per On Mon, Apr 5, 2010 at 11:05 AM, Mark Engelberg <mark.engelb...@gmail.com> wrote: > On my system, knuth-shuffle performs several times faster than Spector's > recursive functional shuffle on smallish lists, and the difference grows > even more dramatic as the list grows, which is what I'd expect (since > knuth-shuffle is O(n) and shuffle is O(n^2)). > > -- > 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 -- 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 To unsubscribe, reply using "remove me" as the subject.
