zuokun23 / algorithm Goto Github PK

if(index == n + 1){

    for(int i = 1 ; i <= n ; i++ ){

        printf("%d",P[i]);
    }
    printf("\n");
}

for( int x = 1; x<=n ; x++){
    if(hashTable[x] == false){

        P[index] = x;
        hashTable[x] = true;
        generateP(index + 1);
        hashTable[x] = false;
    }
}

n = 3;
generateP(1);

return 0;