Hey guys, in this blog we will see a Python Program to Compute all the Permutations of the String.

## Example 1: Using recursion

def get_permutation(string, i=0): if i == len(string): print("".join(string)) for j in range(i, len(string)): words = [c for c in string] # swap words[i], words[j] = words[j], words[i] get_permutation(words, i + 1) print(get_permutation('mlp'))

**Output**

mlp mpl lmp lpm plm pml None

- Here we have
**used the concept of recursion**to create all the permutations of the given string.

## Example 2: Using itertools

from itertools import permutations words = [''.join(p) for p in permutations('mlp')] print(words)

**Output**

['mlp', 'mpl', 'lmp', 'lpm', 'pml', 'plm']

- Here we have used the
**permutation class of a python package called itertools**to create all the permutations of the given string.

Check out our other python programming examples…