great. I wondered about that, too! thanks.
On Jan 11, 7:27 am, James Reeves <weavejes...@googlemail.com> wrote:
> On Jan 11, 6:32 am, "Nick Vogel" <voge...@gmail.com> wrote:
>
> > Ok, first of all, here's how I translated that python code:
>
> > (defn msort [myList]
> > (if (> (count myList) 1)
> > (let [l1 (first myList) l2 (second myList)]
> > (recur (concat (drop 2 myList) (my-merge l1 l2))))
> > (first myList)))
>
> I'd change (> (count myList) 1) to (rest myList). It should work the
> same way, and won't take O(N) time on seqs.
>
> - James
--~--~---------~--~----~------------~-------~--~----~
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
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
-~----------~----~----~----~------~----~------~--~---
