> By the way, I have submitted several Clojure programs to the web site, and am > happy to hear of someone else interested in finding faster Clojure programs > for those problems. I definitely do not wish to discourage your efforts. I > ask these questions because I'd like to help you get to a point where you can > be effective in running the existing programs on your own computer, and you > can compare their performance against any improved programs you write. >
I'm not sure how large these binary trees are, but I recommend this blog entry: http://www.learningclojure.com/2010/09/clojure-faster-than-machine-code.html The author basically constructs a LISP structure out of the input binary tree, compiles it, and the resulting code is insanely fast. Probably wouldn't work for all trees, but in the case of this article it takes about 119 cycles to search a tree of 10 million integers. Timothy -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] Note that posts from new members are moderated - please be patient with your first post. 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
