Anonymous user
Sorting algorithms/Permutation sort: Difference between revisions
Sorting algorithms/Permutation sort (view source)
Revision as of 06:42, 12 August 2009
, 14 years ago→{{header|Haskell}}
(→{{header|Common Lisp}}: CL predicate style) |
|||
Line 220:
insert e l@(h : t) = return (e : l) `mplus`
do { t' <- insert e t ; return (h : t') }</lang>
{{works with|GHC|6.10}}
<lang haskell>import Data.List (permutations)
permutationSort l = head [p | p <- permutations l, sorted p]
sorted (e1 : e2 : r) = e1 <= e2 && sorted (e2 : r)
sorted _ = True</lang>
=={{header|Icon}}==
| |||