{"id":25597,"date":"2017-10-15T19:53:17","date_gmt":"2017-10-15T14:23:17","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25597"},"modified":"2017-10-15T19:53:17","modified_gmt":"2017-10-15T14:23:17","slug":"python-programming-write-program-print-permutations-given-string","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-programming-write-program-print-permutations-given-string\/","title":{"rendered":"PYTHON Programming for Write a program to print all permutations of a given string"},"content":{"rendered":"<p>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 id=\"more-767\"><\/span><br \/>\nSource: Mathword.<\/p>\n<p>Below are the permutations of string ABC ABC ACB BAC BCA CBA CAB<\/p>\n<p>Here is a solution that is used as a basis in backtracking.<\/p>\n<p><img fetchpriority=\"high\" decoding=\"async\" class=\"aligncenter wp-image-25614 size-full\" src=\"https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1.png\" alt=\"python\" width=\"1288\" height=\"524\" srcset=\"https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1.png 1288w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1-300x122.png 300w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1-768x312.png 768w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1-1024x417.png 1024w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1-990x403.png 990w\" sizes=\"(max-width: 1288px) 100vw, 1288px\" \/><\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <span class=\"code-embed-name\">Python<\/span> <\/div> <pre class=\"language-python code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-python code-embed-code\"># Python program to print all permutations with<br\/># duplicates allowed<br\/> <br\/>def toString(List):<br\/>    return &#039;&#039;.join(List)<br\/> <br\/># Function to print permutations of string<br\/># This function takes three parameters:<br\/># 1. String<br\/># 2. Starting index of the string<br\/># 3. Ending index of the string.<br\/>def permute(a, l, r):<br\/>    if l==r:<br\/>        print toString(a)<br\/>    else:<br\/>        for i in xrange(l,r+1):<br\/>            a[l], a[i] = a[i], a[l]<br\/>            permute(a, l+1, r)<br\/>            a[l], a[i] = a[i], a[l] # backtrack<br\/> <br\/># Driver program to test the above function<br\/>string = &quot;ABC&quot;<br\/>n = len(string)<br\/>a = list(string)<br\/>permute(a, 0, n-1)<\/code><\/pre> <\/div>\n<p><strong>Output:<\/strong><\/p>\n<pre>ABC\r\nACB\r\nBAC\r\nBCA\r\nCBA\r\nCAB<\/pre>\n<p><strong><br \/>\nAlgorithm Paradigm: <\/strong>Backtracking<br \/>\n<strong>Time 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=&#8221;banner&#8221;]\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>PYTHON Programming for Write a program to print all permutations &#8211; Mathematical Algorithms &#8211; A permutation, also called an \u201carrangement number\u201d or \u201corder&#8221;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,1,74058,83517],"tags":[74203,74205,74201,74195,73683,73681,74192,74181,74200,73689,74186,73676,74199,74207,73714,70379,73700,74191,73693,73699,73692,73707,74206,73696,73717,74194,74198,74184,74188,74209,74189,73680,73697],"class_list":["post-25597","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-coding","category-mathematical-algorithms","category-python-programming","tag-all-combinations","tag-combination-in-python","tag-combination-permutation","tag-example-of-permutation","tag-itertools","tag-itertools-python","tag-itertools-python-3","tag-itertools-python-tutorial","tag-izip-python","tag-next-permutation","tag-permutatio","tag-permutation","tag-permutation-algorithm","tag-permutation-examples","tag-permutation-generator","tag-permutation-in-c","tag-permutation-in-python","tag-permutation-of","tag-permutation-of-string","tag-permutation-of-string-in-java","tag-permutations-of-a-string","tag-permutations-python","tag-print-all-permutation-of-string-both-iterative-and-recursive-way","tag-print-all-permutations-of-a-string","tag-python-product","tag-python-product-of-list","tag-python-random-list","tag-python-repeat","tag-python-shuffle","tag-random-function-in-python","tag-random-int-python","tag-string-permutation","tag-string-permutation-java"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25597","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=25597"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25597\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25597"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25597"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25597"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}