Author: Eric Latham

Email: [email protected]

This repo holds my solution to the problem of generating string permutations in Python without the help of the itertools library.

The goal is to take a string as input and output a set of permutations equivalent to the following:

from typing import Set
from itertools import permutations

def perms(s: str) -> Set[str]:
  return set("".join(x) for x in permutations(s))

Note that the above code is included here.

0. Solve the trivial case (n<2).
1. Solving the simplest non-trivial case (n=2).
2. Keep stepping up (by incrementing n) until the pattern becomes clear.

In this exercise, I discovered that the natural solution is recursive.

Let s = abc.
- n = 3
- output length = 3! = 3*2*1 = 6

Group permutations based on starting character:
- Permutations starting with a:
  - a + x for x in the permutations of the other characters in s (bc)
    - a + bc = abc
    - a + cb = acb
- Perms starting with b:
  - b + x for x in the permutations of the other characters in s (ac)
    - b + ac = bac
    - b + ca = bca
- Perms starting with c:
  - c + x for x in the permutations of the other characters in s (ab)
    - c + ab = cab
    - c + ba = cba

With all groups combined into one set, you have the answer:
{abc, acb, bac, bca, cab, cba}

This was surprisingly difficult to come up with prior to going through the brainstorming process, but after the brainstorming process, it was very easy.

This solution is also extremely slow, but that's the nature of the algorithm (factorial time!).

Nonetheless, permutations seem to pop up in many places.

I wonder what methods exist for improving it...