Here are the major points:
The algorithm requires that for about 400,000 points there will be
~8,000,000 iterations. This is a very tight loop. You cannot create anything
in this loop, not even a regular Object, much less a temporary Clojure
vector for doing vector math.
The Java version avoids th
David,
could you please post a version of your solution[1] annotated with
some comments on where you used which kind of optimization, and why?
Your code looks very clean to me, and with some additional
explanations I think this could become a good example on how to
optimize computation-heavy Cloj
http://github.com/swannodette/convex-hull/tree/master
This version runs in 2-2.5s. About exactly an order of magnitude slower than
Java.
Amazingly, I did discover afterwards
that there is a Clojure version that is _exactly_ the same speed as
the Java version:
.
.
.
(.test (new TimeJarvisMarch))
http://blog.objectmentor.com/articles/2009/08/11/jarvis-march-in-clojure
--~--~-~--~~~---~--~~
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 fr
