微软100题（70）字符串的全排列

void Permutation(char* element,int start,int end)
{
	if(start==end)
	{
		for (int i=0;i<=end;++i)
			cout<<*(element+i);
		cout<<endl;
	}
	else
	{
		for (int i =start;i<=end;++i)
		{
			swap(*(element+i),*(element+start));
			Permutation(element,start+1,end);
			swap(*(element+i),*(element+start));
		}
	}
}