Hello, I am currently trying to implement part of chapter 7 in let-over- lambda in Clojure. I am used to writing ANSI Common Lisp code and relatively new to Clojure. In CL it is possible to get a performance gain over the standard lisp sort function by using compiled sort networks. I am trying to achieve the same in Clojure.
My measurements are quite disappointing so far. If I use a sample set of 50 Integers and repeat the sorting action 100000 times and compare the Arrays.sort performance against the sort network I currently get following results: "Elapsed time: 16.594209 msecs" "Elapsed time: 1456.444706 msecs" Which is a slow down of a factor of 100. You can find my code here: http://snippets.dzone.com/posts/show/11961 I am aware of the development of enhanced primitive type support: http://www.assembla.com/wiki/show/clojure/Enhanced_Primitive_Support http://clj-me.cgrand.net/2010/06/10/primitive-types-support-for-fns-coming-to-a-clojure-branch-near-you/ Could I expect improvements from those enhancements? My question is basically: 1) Do I do something fundamentally wrong or 2) Do I have to expect that factor of 100 slow down for what I am trying to do in general? -- 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
