sorting-sort.clj

(defn remove-one [item list]
  (let [[n m] (split-with (partial not= item) list)] (vec (concat n (rest m))))) 
       
(defn sorting-sort [unsorted]
   (loop [inner-unsorted unsorted sorted []]
     (let [min-val (apply min inner-unsorted)]
       (if 
         (or 
           (= 1 (count inner-unsorted)) 
           (empty? inner-unsorted))
         sorted
         (recur (remove-one min-val inner-unsorted) (conj sorted min-val))))))