字符串的全排列

void Permutation(char *pstr,char *pBegin)
{
    if (*pBegin==‘\0‘)
    {
        cout<<pstr<<endl;
    }
    else
    {
        for (char *pCh=pBegin;*pCh!=‘\0‘;pCh++)
        {
            char temp=*pCh;
            *pCh=*pBegin;
            *pBegin=temp;

            Permutation(pstr,pBegin+1);

            temp=*pCh;
            *pCh=*pBegin;
            *pBegin=temp;
        }
    }
}

void Permutation(char *pstr)
{
    if (pstr==NULL)
        return;
    Permutation(pstr,pstr);
}