Work in progress. Reviewing sorting algorithms by implementing them in Clojure. Basic algorithms mostly taken from Introduction to Algorithms.
Very rough, not intended for production, use at your own risk, etc. etc.
Comments welcome, in particular stuff like "it would be more efficient to use this kind of Clojure data structure here vs. the vector..." or "you can optimize your heapsort if you do X in your max-heapify function..."
You can run all sorts in a repl with do-all-sorts, or one-by-one (do-heap-sort, etc...).
Copyright © 2013 Dave Della Costa
Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.