after executing the
for
loop, a recursive call has completed; insert n at the left end, and the
case 1:
{
for(i=n-1;i>=1;i--)
p[i+1] = p[i];
p[1] = n;
l[n] = 1;