Sorting algorithms/Permutation sort: Difference between revisions

Content added Content deleted
m (→‎{{header|Sidef}}: minor code improvements)
m (added whitespace before the TOC (table of contents), added a ;Task: (bold) header as well as a task requirement (the directive).)
Line 1: Line 1:
{{task|Sorting Algorithms}}{{Sorting Algorithm}}
{{task|Sorting Algorithms}}
{{Sorting Algorithm}}
{{omit from|GUISS}}
{{omit from|GUISS}}

⚫
Permutation sort, which proceeds by generating the possible permutations
;Task:
⚫
Implement a permutation sort, which proceeds by generating the possible permutations
of the input array/list until discovering the sorted one.
of the input array/list until discovering the sorted one.


Line 8: Line 11:
nextPermutation(list)
nextPermutation(list)
'''done'''
'''done'''
<br><br>


=={{header|ActionScript}}==
=={{header|ActionScript}}==
Retrieved from "https://rosettacode.org/wiki/Sorting_algorithms/Permutation_sort"