On Wed, Dec 29, 2010 at 10:33 PM, Mark Engelberg <mark.engelb...@gmail.com>
> But Racket's stack is only limited by your overall memory. So if you > have enough memory to hold the list you're sorting and the sorted > list, you most likely have enough memory to hold the stack of > computations necessary to generate the list (since the memory needed > for the stack decreases as the output list is built and consumes > memory). > The original algorithm is simply wrong for very large inputs, it cannot be TCO'ed. Pick a ridiculously large list size and the Scheme/Racket program will barf *immediately*. David -- 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
