例2-4 全排列问题

 

 

#include <iostream>

using namespace std;


void perm(char s[], int k, int m)	//从k到m进行全排列
{
	if (k == m)
	{
		for (int i = 0; i <= m; i++)
		{
			cout << s[i];
		}
		cout << endl;
	}
	else
	{
		for (int i = k; i <= m; i++)
		{
			swap(s[i], s[k]);
			perm(s, k + 1, m);
			swap(s[i], s[k]);
		}
	}
}

int main()
{
	char s[100]="";
	char temp;
	
	for (int i = 0; (temp = getchar()) != '\n';i++)
	{
		s[i] = temp;
	}
	cout << s;
	int len = strlen(s);
	perm(s,0,len - 1);

	return 0;
}