On Jan 15, 1:37 pm, e <[email protected]> wrote: > What would be a good way to implement quicksort in clojure (or any > persistent language)?
Lennart Augustsson's point is that destructive updates are part of the Quicksort algorithm. If we accept that, then you'd want to use a plain old java array in your algorithm. Personally, I'd be inclined to use mergesort in a functional programming language. It's easier to implement, easier to parallize and better with linked lists. - James --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/clojure?hl=en -~----------~----~----~----~------~----~------~--~---
