Jump to content

Sorting algorithms/Permutation sort: Difference between revisions

(rearranges in order of the language.)
Line 1,093:
<pre>Input = c b e d a
Output = a b c d e</pre>
 
=={{header|Phix}}==
<lang Phix>function inOrder(sequence s)
for i=2 to length(s) do
if s[i]<s[i-1] then return 0 end if
end for
return 1
end function
 
function permutationSort(sequence s)
for n=1 to factorial(length(s)) do
sequence perm = permute(n,s)
if inOrder(perm) then return perm end if
end for
?9/0 -- should never happen
end function
 
?permutationSort({"dog",0,15.545,{"cat","pile","abcde",1},"cat"})</lang>
{{out}}
<pre>
{0,15.545,"cat","dog",{"cat","pile","abcde",1}}
</pre>
 
=={{header|PHP}}==
7,805

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.