Out of curiosity, I wrote a simple non-optimized quicksort function in Common Lisp (SBCL) and timed a 180,000-element sort at 567ms, about half as much as the J

Out of curiosity, I wrote a simple non-optimized quicksort function in Common Lisp (SBCL) and timed a 180,000-element sort at 567ms, about half as much as the Java version. I'm sure that could be improved greatly with better coding and type hints. Here's the code http://donnieknows.com/blog/sbcl-fast http://donnieknows.com/blog/sbcl-fast