Anonymous user
Sorting algorithms/Permutation sort: Difference between revisions
Sorting algorithms/Permutation sort (view source)
Revision as of 18:52, 19 August 2016
, 7 years agoadded whitespace before the TOC (table of contents), added a ;Task: (bold) header as well as a task requirement (the directive).
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:
{{task|Sorting Algorithms
{{Sorting Algorithm}}
{{omit from|GUISS}}
Permutation sort, which proceeds by generating the possible permutations ▼
;Task:
of the input array/list until discovering the sorted one.
Line 8 ⟶ 11:
nextPermutation(list)
'''done'''
<br><br>
=={{header|ActionScript}}==
| |||