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

this.n = n;

this.r = r;

a = new int[r];

BigInteger nFact = getFactorial(n);

BigInteger rFact = getFactorial(r);

BigInteger nminusrFact = getFactorial(n - r);

total = nFact.divide(rFact.multiply(nminusrFact));

reset();

}

//------

// Reset

//------

public void reset() {

for (int i = 0; i < a.length; i++) {

a[i] = i;

}

numLeft = new BigInteger(total.toString());

} // Return number of combinations not yet generated

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

public BigInteger getNumLeft() {

return numLeft;

}

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

// Are there more combinations?

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

public boolean hasMore() {

return numLeft.compareTo(BigInteger.ZERO) == 1;

} // Return total number of combinations

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