Skip to content

⚡️ Speed up function binomial_coefficient_recursive by 561,283% #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 1 commit into from
Closed

⚡️ Speed up function binomial_coefficient_recursive by 561,283% #18

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 14 additions & 4 deletions src/numpy_pandas/numerical_methods.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,11 +19,21 @@ def numerical_integration_rectangle(


def binomial_coefficient_recursive(n: int, k: int) -> int:
# Use a cache to store previously computed results for faster lookups
if not hasattr(binomial_coefficient_recursive, "_cache"):
binomial_coefficient_recursive._cache = {}
cache = binomial_coefficient_recursive._cache
key = (n, k)
if key in cache:
return cache[key]
if k == 0 or k == n:
return 1
return binomial_coefficient_recursive(
n - 1, k - 1
) + binomial_coefficient_recursive(n - 1, k)
result = 1
else:
result = binomial_coefficient_recursive(
n - 1, k - 1
) + binomial_coefficient_recursive(n - 1, k)
cache[key] = result
return result


def naive_matrix_determinant(matrix: List[List[float]]) -> float:
Expand Down