Write A Program To Print All Permutations of A Given String
The document discusses permutations of a string and provides a Python program to print all permutations of a given string. It defines what a permutation is, provides examples of permutations of the string 'ABC', and includes the Python code to find all permutations.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
20 views
Write A Program To Print All Permutations of A Given String
The document discusses permutations of a string and provides a Python program to print all permutations of a given string. It defines what a permutation is, provides examples of permutations of the string 'ABC', and includes the Python code to find all permutations.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2
Write a program to print all permutations
of a given string
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! permutation. Source: Mathword(http://mathworld.wolfram.com/Permutation.html) Below are the permutations of string ABC. ABC ACB BAC BCA CBA CAB # Python program to print all permutations with # duplicates allowed
def toString(List): return ''.join(List)
# Function to print permutations of string
# This function takes three parameters: # 1. String # 2. Starting index of the string # 3. Ending index of the string. def permute(a, l, r): if l==r: print toString(a) else: for i in xrange(l,r+1): a[l], a[i] = a[i], a[l] permute(a, l+1, r) a[l], a[i] = a[i], a[l] # backtrack
# Driver program to test the above function
string = "ABC" n = len(string) a = list(string) permute(a, 0, n-1) # This code is contributed by Bhavya Jain