排列和组合算法的实现方法_C语言经典案例

 #include  #include  char array[] = "abcd"; #define N 4 #define M 3 int queue[N] = {0}; int top = 0; int flag[N] = {0}; void perm(int s, int n) { int i; if (s > n) { return; } if (s == n) { for (i = 0; i  n) return ; if (top == m) { for (i = 0; i 

 perm(): abcd  abdc  acbd  acdb  adbc  adcb  bacd  badc  bcad  bcda bdac  bdca  cabd  cadb  cbad  cbda  cdab  cdba  dabc  dacb dbac  dbca  dcab  dcba combination(): abc   abd   acd   bcd