Jump to content

Sorting algorithms/Permutation sort: Difference between revisions

m
(→‎{{header|Groovy}}: new solution)
Line 469:
println permutationSort([10.00, 10.0, 10, 1])</lang>
The examples with distinct integer and decimal values that compare as equal are there to demonstrate, but not to prove, that the sort is stable.
 
Output:
<pre>.............................................................................................[-45, -1, 0, 7, 12]
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.