(int[] comb, int index, int k, int n)
| 195 | } |
| 196 | |
| 197 | public static void idxToComb(int[] comb, int index, int k, int n) { |
| 198 | for (int i = n - 1; i >= 0; i--) { |
| 199 | if (index >= Cnk[i][k]) { |
| 200 | index -= Cnk[i][k--]; |
| 201 | comb[i] = 1; |
| 202 | } else comb[i] = 0; |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | public static boolean permutationSign(int[] permutation) { |
| 207 | int nInversions = 0; |
no outgoing calls
no test coverage detected