P405: Enumeration of all permutations of a set of elements

P405: Enumeration of all permutations of a set of elements

Input:

A set $S$.

Output:

All permutations of $S$

Complexity:

Comment:

He proposed the general algorithm for some combinatorial problems.

Reference:

[Ehrlich1973a] (Bibtex)