mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 13:49:30 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
21 lines
438 B
Python
21 lines
438 B
Python
def binomial_coefficient(n, r):
|
|
"""
|
|
Find binomial coefficient using pascals triangle.
|
|
|
|
>>> binomial_coefficient(10, 5)
|
|
252
|
|
"""
|
|
c = [0 for i in range(r + 1)]
|
|
# nc0 = 1
|
|
c[0] = 1
|
|
for i in range(1, n + 1):
|
|
# to compute current row from previous row.
|
|
j = min(i, r)
|
|
while j > 0:
|
|
c[j] += c[j - 1]
|
|
j -= 1
|
|
return c[r]
|
|
|
|
|
|
print(binomial_coefficient(n=10, r=5))
|