ok solved
Code:#include <iostream> //protatip recursive works #include <algorithm> using namespace std; int pro(int *myints,int n,int k) { do { if( k== n*(n-1) ) { for(int i=0 ; i<12 ; i++) cout << myints[i]; cout<<endl; break; } pro(myints,n,k+(n-1)); } while(next_permutation( myints+k , myints+(k + (n-1) ) )); } int main() { int n=4; // the " myints[] " size n*(n-1) , int myints[] = {1,2,3,4,5,6,7,8,9}; int k=0; pro(myints,n,k); return 0; }