Курсовая работа: Метод последовательных сравнений

return total;

}

//------------------

// Compute factorial

//------------------

private static BigInteger getFactorial(int n) {

BigInteger fact = BigInteger.ONE;

for (int i = n; i > 1; i--) {

fact = fact.multiply(new BigInteger(Integer.toString(i)));

}

return fact;

}

//--------------------------------

// Generate next combination (algorithm from Rosen p. 286)

//----------------------------------

public int[] getNext() {

if (numLeft.equals(total)) {

numLeft = numLeft.subtract(BigInteger.ONE);

return a;

}

int i = r - 1;

while (a[i] == n - r + i) {

i--;

}

a[i] = a[i] + 1;

for (int j = i + 1; j < r; j++) {

a[j] = a[i] + j - i;

}

numLeft = numLeft.subtract(BigInteger.ONE);