Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void next_perm(int n,int P[])
- {
- int k=n;
- while(P[k-1]>P[k])
- --k;
- --k;
- int j=k+1,MIN=n+1,jmin;
- while(j<=n)
- {
- if(P[j]>P[k])
- if(P[j]<MIN)
- MIN=P[j],jmin=j;
- ++j;
- }
- swap(P[k],P[jmin]);
- for(int i=k+1;i<=(n+k+1)/2;++i)
- swap(P[i],P[n+k+1-i]);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement