In the way of programming there is some problems on thye basis of finding the permutation. Today I am giving a sample to create all permutations of an string.<\/p>\n
using namespace std;<\/p>\n int main () {<\/p>\n int n,i,l; gets(myints); do { return 0; In the way of programming there is some problems on thye basis of finding the permutation. Today I am giving a sample to create all permutations of an string. \/\/ next_permutation #include <stdio.h> #include <string.h> #include <iostream> #include <algorithm> using namespace std; int main () { int n,i,l; char myints[1000]; gets(myints); l=strlen(myints); sort (myints,myints+l); do … <\/p>\n
\n\/\/ next_permutation
\n#include <stdio.h>
\n#include <string.h>
\n#include <iostream>
\n#include <algorithm><\/p>\n
\n char myints[1000];<\/p>\n
\n l=strlen(myints);
\n sort (myints,myints+l);<\/p>\n
\n cout << myints<< endl;
\n } while ( next_permutation (myints,myints+l) );<\/p>\n
\n}
\n<\/code><\/p>\n","protected":false},"excerpt":{"rendered":"