STL: 中 next_permutation()生成全排列

認識來源：http://blog.csdn.net/killua_hzl/article/details/3887429

http://www.slyar.com/blog/stl_next_permutation.html

/*
 * bool next_permutation()
 * like sort()
 *
 * how to use:
 * http://blog.csdn.net/aipb2008/article/details/2227490
 */
#include <algorithm>
#include <string.h>
#include <iostream>
using namespace std;

int cmp(char , char);

int main() {
	char str1[] = "AaBb";

	int n;

	n = strlen(str1);

	do {
		cout<<str1<<endl;
	} while (next_permutation(str1, str1 + n));

	return 0;
}

int cmp(char a, char b) {
	if (tolower(a) == tolower(b)) {
		return (a - b);
	}else { 
		return (tolower(a) - tolower(b));
	}
}