Permutations - Used Array Pattern

At each position, try all unused elements. Track which elements are used with a boolean array.

$1.$ If current permutation has $n$ elements, add to results.

$2.$ For each unused element, mark it used, add to current, recurse, then backtrack.

The number of permutations is $n!$.