[算法设计-字符的全排列问题]

代码：

#include<iostream>
using namespace std;
void swap(char &a, char &b)
{
char temp = a;
a = b;
b = temp;
}
void func(char a[], int m, int n)
{
if (m == n)
{
for (int i = 0; i <= n; i++)
cout << a[i] << " ";
cout << endl;
}
else
{
for (int i = m; i <= n; i++)
{
swap(a[m], a[i]);
func(a, m + 1, n);
swap(a[m], a[i]);
}
}
}
int main(void)
{
char a[] = "abc";
func(a, 0, 2);
}

结果：