Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 03:11, 10 November 2016
, 7 years ago→{{header|Clojure}}
(added FreeBASIC) |
|||
Line 455:
=={{header|Clojure}}==
<lang clojure>
(defn insertion-sort [coll]
(reduce (fn [result input]
(let [[less more] (split-with #(< % input) result)]
(concat less [input] more)))
[]
coll))
</lang>
Translated from the Haskell example:
<lang clojure>
(letfn [(insert ([raw x](insert [] raw x))
([sorted [y & raw] x]
| |||