{"id":25593,"date":"2017-10-15T19:29:48","date_gmt":"2017-10-15T13:59:48","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25593"},"modified":"2017-10-15T19:29:48","modified_gmt":"2017-10-15T13:59:48","slug":"c-programming-write-program-print-permutations-given-string-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-write-program-print-permutations-given-string-2\/","title":{"rendered":"C Programming for 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

\"c\"<\/p>\n

 <\/p>\n

 <\/p>\n

C<\/span> <\/div> 
\/\/ C program to print all permutations with duplicates allowed#include <stdio.h>#include <string.h> \/* Function to swap values at two pointers *\/void swap(char *x, char *y){    char temp;    temp = *x;    *x = *y;    *y = temp;} \/* 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. *\/void permute(char *a, int l, int r){   int i;   if (l == r)     printf("%s\\n", a);   else   {       for (i = l; i <= r; i++)       {          swap((a+l), (a+i));          permute(a, l+1, r);          swap((a+l), (a+i)); \/\/backtrack       }   }} \/* Driver program to test above functions *\/int main(){    char str[] = "ABC";    int n = strlen(str);    permute(str, 0, n-1);    return 0;}<\/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
 <\/p>\n","protected":false},"excerpt":{"rendered":"
C Programming for Write a program to print all permutations of a given string – Mathematical Algorithms – A permutation, also called an \u201carrangement number\u201d<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,69866,1,74058],"tags":[70323,70348,70351,70331,70326,70340,70338,74276,70366,74267,70328,74261,73693,70384,73690,74275,74262,70329,70347,74271,73711,74263,74259],"class_list":["post-25593","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming","category-coding","category-mathematical-algorithms","tag-permutation-and-combination","tag-permutation-and-combination-calculator","tag-permutation-and-combination-examples","tag-permutation-and-combination-formula","tag-permutation-and-combination-pdf","tag-permutation-and-combination-problems","tag-permutation-combination","tag-permutation-combination-examples","tag-permutation-combination-formula","tag-permutation-examples-math","tag-permutation-formula","tag-permutation-formula-calculator","tag-permutation-of-string","tag-permutation-program-in-c","tag-permutation-questions","tag-permutation-with-repetition","tag-permutation-word-problems","tag-permutations-and-combinations","tag-permutations-and-combinations-formula","tag-permutations-and-combinations-pdf","tag-printall","tag-software-engineer-interview-questions-and-answers","tag-solving-for-r-in-permutations"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25593","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=25593"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25593\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25593"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25593"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25593"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}