Quick sort in Clojure

	(defn quicksort [coll]
	(if (empty? coll)
	'()
	(let [el (first coll)
	smaller (filter #(<= % el) (rest coll))
	greater (filter #(> % el) (rest coll))]
	(concat (quicksort smaller)
	(cons el (quicksort greater))))))

view raw quicksort.clj hosted with ❤ by GitHub

Compare it with the same algorithm implemented in Haskell.