{"id":25518,"date":"2017-10-15T19:01:53","date_gmt":"2017-10-15T13:31:53","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25518"},"modified":"2017-10-15T19:01:53","modified_gmt":"2017-10-15T13:31:53","slug":"write-program-print-permutations-given-string-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/write-program-print-permutations-given-string-2\/","title":{"rendered":"C++ Programming-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(<a href=\"http:\/\/mathworld.wolfram.com\/Permutation.html\" target=\"_blank\" rel=\"noopener\">http:\/\/mathworld.wolfram.com\/Permutation.html<\/a>)<\/p>\n<p>Below are the permutations of string ABC.<br \/>\nABC 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 size-full wp-image-25516\" src=\"https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation.png\" alt=\"Write a program to print all permutations of a given string\" width=\"1288\" height=\"524\" srcset=\"https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation.png 1288w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-300x122.png 300w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-768x312.png 768w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-1024x417.png 1024w, https:\/\/www.wikitechy.com\/technology\/wp-content\/uploads\/2017\/05\/NewPermutation-990x403.png 990w\" sizes=\"(max-width: 1288px) 100vw, 1288px\" \/><\/p>\n<p><strong>C++ Programming<\/strong><\/p>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <span class=\"code-embed-name\">C<\/span> <\/div> <pre class=\"language-c code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-c code-embed-code\">\/\/ C program to print all permutations with duplicates allowed<br\/>#include &lt;stdio.h&gt;<br\/>#include &lt;string.h&gt;<br\/> <br\/>\/* Function to swap values at two pointers *\/<br\/>void swap(char *x, char *y)<br\/>{<br\/>    char temp;<br\/>    temp = *x;<br\/>    *x = *y;<br\/>    *y = temp;<br\/>}<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\/>void permute(char *a, int l, int r)<br\/>{<br\/>   int i;<br\/>   if (l == r)<br\/>     printf(&quot;%s\\n&quot;, a);<br\/>   else<br\/>   {<br\/>       for (i = l; i &lt;= r; i++)<br\/>       {<br\/>          swap((a+l), (a+i));<br\/>          permute(a, l+1, r);<br\/>          swap((a+l), (a+i)); \/\/backtrack<br\/>       }<br\/>   }<br\/>}<br\/> <br\/>\/* Driver program to test above functions *\/<br\/>int main()<br\/>{<br\/>    char str[] = &quot;ABC&quot;;<br\/>    int n = strlen(str);<br\/>    permute(str, 0, n-1);<br\/>    return 0;<br\/>}<\/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","protected":false},"excerpt":{"rendered":"<p>C++ Programming-Write a program to print all permutations of a given string &#8211; Searching and Sorting &#8211; 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":[69969,83515,1,71670],"tags":[73716,73695,73684,73705,73709,73688,73694,73698,73715,73681,73712,73689,73706,73704,73714,70379,73701,73700,73693,73699,70384,73690,73692,73707,73696,73713,73691,73711,73703,73682,73702,73057,73685,73686,73687,73718,73680,73697,73148],"class_list":["post-25518","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming-3","category-coding","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-examples-of-programs-written-in-python","tag-how-to-print-a-string-in-c","tag-how-to-print-string-in-c","tag-itertools-product","tag-itertools-python","tag-java-permutations","tag-next-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-language-example","tag-python-permutations","tag-python-print-list","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\/25518","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=25518"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25518\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25518"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25518"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25518"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}