Creating an arrangement template for a re-set

Builds the permutations of the re-set, generated in the order of the original strings. From the purple book above the code, very useful

void permutation (int n,char *p,char *a,int cur)
{
    if (cur==n)
    {for
        (int i=0;i<n;i++)
            cout< <A[i];
        cout<<endl;
    }
    else
    {for
        (int i=0;i<n;i++)
        {
            if (!i| | P[i]!=p[i-1])
            {
                int c1=0,c2=0;
                for (int j=0;j<cur;j++)
                    if (A[j]==p[i])
                    c1++;
                for (int j=0;j<n;j++)
                    if (P[i]==p[j])
                    c2++;
                if (C1<C2)
                {
                    a[cur]=p[i];
                    Permutation (n,p,a,cur+1);}}}}