Sorting algorithms/Permutation sort: Difference between revisions
Content added Content deleted
(→{{header|Groovy}}: new solution) |
|||
| Line 469: | Line 469: | ||
println permutationSort([10.00, 10.0, 10, 1])</lang> |
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. |
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: |
Output: |
||
<pre>.............................................................................................[-45, -1, 0, 7, 12] |
<pre>.............................................................................................[-45, -1, 0, 7, 12] |
||