Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 20:54, 28 October 2009
, 14 years agono edit summary
(Add Seed7 insertion sort) |
No edit summary |
||
Line 147:
printf("%d ", intArray[i]);
}</lang>
=={{header|Clojure}}==
Translated from the Haskell example:
<lang lisp>
(defn in-sort! [data]
(letfn [(insert ([raw x](insert [] raw x))
([sorted [y & raw] x]
(if (nil? y) (conj sorted x)
(if (<= x y ) (concat sorted [x,y] raw)
(recur (conj sorted y) raw x )))))]
(reduce insert [] data)))
;Usage:(in-sort! [6,8,5,9,3,2,1,4,7])
;Returns: [1 2 3 4 5 6 7 8 9]
</lang>
=={{header|Common Lisp}}==
| |||