2.1.3 Unordered Sampling without Replacement: Combinations

Combinations and Permutations

Efficient Algorithm for Combinations With Replacement (n choose k)

n choose k replacement

algorithm - Calculate value of n choose k - Stack Overflow

What is the most efficient method to evaluate the value of n choose k ? The brute force way I think would be to find n factorial / k factorial / (n-k) factorial .

n choose k calculator

Combination - Wikipedia