字符串的全排列_递归实现

#include<iostream>
using namespace std;
void CalcAllPermutation(char* perm, int from, int to){
if (to <= 1){
return;
}
if (from == to){
for (int i = 0; i <= to; i++){
cout << perm[i];
}
cout << endl;
}
else{
for (int j = from; j <= to; j++){
swap(perm[j], perm[from]);
CalcAllPermutation(perm, from + 1, to);
swap(perm[j], perm[from]);
}
}
}
int main()
{
char str[100];
int i = -1;
do{
i++;
cin >> str[i];
} while (str[i] != '1');

CalcAllPermutation(str, 0,i-1 );//strlen(str) - 1
return 0;

}
//若已知char str[20]；，有语句cin＞＞str； 当输入为： This is a program 所得的结果是str = ()。
//B．This