递归（回溯）算法

[cc lang=”java”]
package ccpc;

//求n个元素的全排列
public class paixu {
public static void f(char[] data, int k) {
if (k == data.length) {
for (int a = 0; a < data.length; a++) {
System.out.print(data[a] + ” “);
}
System.out.println();
}
for (int i = k; i < data.length; i++) {
{
char r = data[k];
data[k] = data[i];
data[i] = r;// 试探
}
f(data, k + 1);
{
char r = data[k];
data[k] = data[i];
data[i] = r;// 回溯
}
}
}
public static void main(String[] args) {
char[] a = “ABC”.toCharArray();
f(a, 0);

}

}
[/cc]

运行输出结果：

A B C
A C B
B A C
B C A
C B A
C A B