Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community. Issues are used to track todos, bugs, feature requests, and more.

#C(n,k) = C(n,n-k), so if n/2 is sufficiently small, we can reduce the problem size. return recursive_binomial_coefficient(n,n-k) #else, we know C(n,k) = (n/k)C(n-1,k-1), so we can use this to reduce ...