Quicksort implemented in Clojure

quicksort.clj

(defn qpart [data p]
     (reduce (fn [acc item]
               (cond
                 (< item p) (assoc acc :left (conj (:left acc) item))
                 (> item p) (assoc acc :right (conj (:right acc) item))
                  :else (assoc acc :ps (conj (:ps acc) item))))
             {:left [] :right [] :ps []} data))



(defn quicksort [data]
   (if (< (count data) 2)
     data
     (let [pindex (rand-int (count data))
           p (nth data pindex)
           partitions (qpart data p)
           left (quicksort (:left partitions))
           right (quicksort (:right partitions))
           result (concat left (:ps partitions) right)]
         result)))