Finding all of the permutations of a sequence (Python)
def permutations(seq):
if len(seq) == 1:
return [seq]
i = 0
perms = []
while i < len(seq):
elem = seq.pop(i)
latter_perms = permutations(seq)
for perm in latter_perms:
perms.append([elem] + perm)
seq.insert(i, elem)
i += 1
return perms
