clojureでqsortその2.clj

(ns org.program.main)

(defn qsort [v]
 (cond
  (>= 1 (count v)) v
  :else (let [p     (first v)
              r     (rest  v)
              sieve (fn self [[arg-vec cmp-fn]]
                     (concat
                      (if (cmp-fn (first arg-vec) p) [(first arg-vec)] [])
                      (if (zero? (count (rest arg-vec))) [] (self [(rest arg-vec) cmp-fn]))))]
         (vec (concat (qsort (sieve [r (fn [x y] (< x y))])) [p] (qsort (sieve [r (fn [x y] (>= x y))])))))))

(defn -main [n]
 (qsort n))