RosettaCodeData/Task/Sorting-algorithms-Permutat.../00DESCRIPTION

10 lines
265 B
Plaintext

{{Sorting Algorithm}}
{{omit from|GUISS}}
Permutation sort, which proceeds by generating the possible permutations
of the input array/list until discovering the sorted one.
Pseudocode:
'''while not''' InOrder(list) '''do'''
nextPermutation(list)
'''done'''