{"id":25520,"date":"2017-10-15T19:03:53","date_gmt":"2017-10-15T13:33:53","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25520"},"modified":"2017-10-15T19:03:53","modified_gmt":"2017-10-15T13:33:53","slug":"write-program-print-permutations-given-string-3","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/write-program-print-permutations-given-string-3\/","title":{"rendered":"PYTHON Programming-Write a program to print all permutations of a given string"},"content":{"rendered":"

A permutation, also called an \u201carrangement number\u201d or \u201corder,\u201d 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.<\/span>
\nSource: Mathword(http:\/\/mathworld.wolfram.com\/Permutation.html<\/a>)<\/p>\n

Below are the permutations of string ABC.
\nABC ACB BAC BCA CBA CAB<\/p>\n

Here is a solution that is used as a basis in backtracking.<\/p>\n

\"Write<\/p>\n

PYTHON Programming<\/strong><\/p>\n

Java<\/span> <\/div> 
# 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 functionstring = "ABC"n = len(string)a = list(string)permute(a, 0, n-1)<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
ABC\r\nACB\r\nBAC\r\nBCA\r\nCBA\r\nCAB<\/pre>\n

\nAlgorithm Paradigm: <\/strong>Backtracking
\nTime Complexity: <\/strong>O(n*n!) Note that there are n! permutations and it requires O(n) time to print a a permutation.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
PYTHON Programming-Write a program to print all permutations of a given string – Searching and Sorting – A permutation, also called an \u201carrangement number\u201d. or \u201corder,\u201d is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,83517,71670],"tags":[73716,73695,73684,73705,73709,73166,73688,73694,73698,73683,73715,73681,73712,73689,73676,73706,73704,73714,70379,73701,73700,73693,73699,70384,73690,73692,73707,73696,73713,73691,73711,73703,73678,73679,73708,73682,73710,73702,73057,73717,73675,73677,73685,73686,73687,73718,73680,73697,73148],"class_list":["post-25520","post","type-post","status-publish","format-standard","hentry","category-coding","category-python-programming","category-searching-and-sorting","tag-a-given","tag-abc-for-java-and-testing-fb","tag-all-c-programs","tag-all-possible-combinations","tag-combinations-python","tag-cstring-find","tag-examples-of-programs-written-in-python","tag-how-to-print-a-string-in-c","tag-how-to-print-string-in-c","tag-itertools","tag-itertools-product","tag-itertools-python","tag-java-permutations","tag-next-permutation","tag-permutation","tag-permutation-c","tag-permutation-c-code","tag-permutation-generator","tag-permutation-in-c","tag-permutation-in-java","tag-permutation-in-python","tag-permutation-of-string","tag-permutation-of-string-in-java","tag-permutation-program-in-c","tag-permutation-questions","tag-permutations-of-a-string","tag-permutations-python","tag-print-all-permutations-of-a-string","tag-print-list-python","tag-print-string-in-c","tag-printall","tag-python-combinations","tag-python-example-programs","tag-python-itertools","tag-python-itertools-combinations","tag-python-language-example","tag-python-list-unique","tag-python-permutations","tag-python-print-list","tag-python-product","tag-python-programming-examples","tag-python-script-example","tag-recursion-examples","tag-recursion-in-python","tag-sample-python-script","tag-simple-python-script","tag-string-permutation","tag-string-permutation-java","tag-string-programs-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25520","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25520"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25520\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25520"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25520"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25520"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}