recycle in permutationthanks, when i put this function as your suggestion, [code] for (int i = 0; i <= 4; i++) { ...
recycle in permutation[code] void starterequiv(int *arr, int start, int SIZE) { int count = 1; if (start > SIZE) ...
recycle in permutationok.its help me so much. but i have to use my own algorithm in spite of next-permutation. Maybe its q...
recycle in permutationok. thanks for the reply me. my algorithm output as follows: n= 4 1234 1243 1423 1432 1234 124...
recycle in permutationhello, dear all. i'have small problem. here is my algorithm #include <stdio.h> /** Read a ...
This user does not accept Private Messages