{"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":"

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

C++ Programming<\/strong><\/p>\n[pastacode lang=\u201dc\u201d manual=\u201d%2F%2F%20C%20program%20to%20print%20all%20permutations%20with%20duplicates%20allowed%0A%23include%20%3Cstdio.h%3E%0A%23include%20%3Cstring.h%3E%0A%20%0A%2F*%20Function%20to%20swap%20values%20at%20two%20pointers%20*%2F%0Avoid%20swap(char%20*x%2C%20char%20*y)%0A%7B%0A%20%20%20%20char%20temp%3B%0A%20%20%20%20temp%20%3D%20*x%3B%0A%20%20%20%20*x%20%3D%20*y%3B%0A%20%20%20%20*y%20%3D%20temp%3B%0A%7D%0A%20%0A%2F*%20Function%20to%20print%20permutations%20of%20string%0A%20%20%20This%20function%20takes%20three%20parameters%3A%0A%20%20%201.%20String%0A%20%20%202.%20Starting%20index%20of%20the%20string%0A%20%20%203.%20Ending%20index%20of%20the%20string.%20*%2F%0Avoid%20permute(char%20*a%2C%20int%20l%2C%20int%20r)%0A%7B%0A%20%20%20int%20i%3B%0A%20%20%20if%20(l%20%3D%3D%20r)%0A%20%20%20%20%20printf(%22%25s%5Cn%22%2C%20a)%3B%0A%20%20%20else%0A%20%20%20%7B%0A%20%20%20%20%20%20%20for%20(i%20%3D%20l%3B%20i%20%3C%3D%20r%3B%20i%2B%2B)%0A%20%20%20%20%20%20%20%7B%0A%20%20%20%20%20%20%20%20%20%20swap((a%2Bl)%2C%20(a%2Bi))%3B%0A%20%20%20%20%20%20%20%20%20%20permute(a%2C%20l%2B1%2C%20r)%3B%0A%20%20%20%20%20%20%20%20%20%20swap((a%2Bl)%2C%20(a%2Bi))%3B%20%2F%2Fbacktrack%0A%20%20%20%20%20%20%20%7D%0A%20%20%20%7D%0A%7D%0A%20%0A%2F*%20Driver%20program%20to%20test%20above%20functions%20*%2F%0Aint%20main()%0A%7B%0A%20%20%20%20char%20str%5B%5D%20%3D%20%22ABC%22%3B%0A%20%20%20%20int%20n%20%3D%20strlen(str)%3B%0A%20%20%20%20permute(str%2C%200%2C%20n-1)%3B%0A%20%20%20%20return%200%3B%0A%7D\u201d message=\u201dC\u201d highlight=\u201d\u201d provider=\u201dmanual\u201d\/]\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=\u201dbanner\u201d]\n","protected":false},"excerpt":{"rendered":"
C++ 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":[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}]}}