"Given a string, write a function that uses recursion to output a list of all the possible permutations of that string.\n", "* For each character in the initial string, set aside that character and ...

A permutation, also called an "arrangement number" or "order" is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n!