quick-sort.clj

(defn quick-sort
  "Takes a list and sorts it following the quick sort algorithm"
  [lst]
  (if (empty? lst) []
      (concat
        (quick-sort (filter (partial > (first lst)) (rest lst)))
        (list (first lst))
        (quick-sort (filter (partial <= (first lst)) (rest lst))))))


(defn quick-sort2
  "Alternate, Haskell style quicksort- my personal favorite"
  [lst]
  (if (empty? lst) []
      (let [[pivot & rst] lst]
        (lazy-cat (quick-sort2 (for [before rst :when (< before pivot)] before))
                  [pivot]
                  (quick-sort2 (for [after rst :when (>= after pivot)] after))))))