输出一组元素的全排列(可包含重复元素)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

template <class T>
int Compare(const void *a, const void *b)
{
	return *reinterpret_cast<const T*>(a) - *reinterpret_cast<const T*>(b);
}

template <class T>
void swap(T &a, T &b)
{
	T tmp = a;
	a = b;
	b = tmp;
}

template <class T>
void Revert(T *start, T *end)
{
	while(start < end)
	{
		swap(*start++, *end--);
	}
}

template <class T>
bool NextStatus(T *list, int len)
{
	int i = len - 2;
	while (i >= 0 && Compare<T>(list + i, list + i + 1) >= 0)
	{
		i--;
	}

	if (i < 0)
	{
		return false;
	}

	for (int k = len - 1; k > i; k--)
	{
		if (Compare<T>(list + k, list + i) > 0)
		{
			swap(*(list + k), *(list + i));
			Revert(list + i + 1, list + len -1);
			break;
		}
	}

	return true;
}

int DisplayAllArr(const char *arr)
{
	int count = 0;
	int len = strlen(arr);
	char *list = _strdup(arr);
	char cha = 'a', chb = 'b';
	int tmp = Compare<char>(&cha, &chb);
	qsort(list, len, sizeof(char), Compare<char>);
	
	do
	{
		puts(list);
		count++;
	} while (NextStatus(list, len));


	free(list);
	return count;
}

int main()
{
	char arr[128];
	while (gets_s(arr))
	{
		puts("The all arr are:");
		int count = DisplayAllArr(arr);
		printf("Count is %d\n", count);
	}
	return 0;
}