public Permutation Element(BigInteger k) { if (k >= Factorial(this.n)) throw new Exception("k too large in Element"); Permutation result = new Permutation(this.n ...
public Permutation Successor() { if ((left == 0) && data[left] > data[left+1)) return null; Permutation result = new Permutation(this.n); for (int idx = 0; idx ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback