{{Sorting Algorithm}}
{{omit from|GUISS}}

;Task:
Implement a 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'''
<br><br>