全排列

public class tmp {
	public static int n = 3;
	public static int[] flag = new int[n + 1];
	public static int count = 1;
	public static int cou = 0;
	public static int[] ans = new int[n + 1];

	public static void main(String[] args) {
		print();
		System.out.println(cou);
	}

	public static void print() {

		for (int i = 1; i < n + 1; i++) {
			if (flag[i] == 0) {
				ans[count] = i;
				flag[i] = 1;
				count++;
				print();
				flag[i] = 0;
				count--;
			}
		}
		if (count == n) {
			cou++;
			for (int i = 1; i <= n; i++)
				System.out.print(ans[i] + " ");
			System.out.println();
		}
	}
}

另一个版本（标准）：没有手动码一遍，看着比较简单。

package sword;

public class tmpn {
	public static int total = 0;

	public static void swap(String[] str, int i, int j) {
		String temp = new String();
		temp = str[i];
		str[i] = str[j];
		str[j] = temp;
	}

	public static void arrange(String[] str, int st, int len) {
		if (st == len - 1) {
			for (int i = 0; i < len; i++) {
				System.out.print(str[i] + "  ");
			}
			System.out.println();
			total++;
		} else {
			for (int i = st; i < len; i++) {
				swap(str, st, i);
				arrange(str, st + 1, len);
				swap(str, st, i);
			}
		}

	}

	public static void main(String[] args) {
		String str[] = { "a", "b", "c" };
		arrange(str, 0, str.length);
		System.out.println(total);
	}
}