permutate.py

permutate.py

def permutate(word):
	returnList = []
	if len(word) == 1:
		returnList.append(word)
	for pos in range(len(word)):
		# Recursively find permutations of the word
		# that does not contain the letter in position
		permuteList = permutate(word[0:pos] + word[pos+1:len(word)])
	
		# For each of those permutations, add
		# the missing letter in the right position
		for item in permuteList:
			returnList.append(word[pos] + item)
	# Make this set unique
	return list(set(returnList))

permutate("hello")