Git-Mirrors/master-algorithms-py
1
0
Fork 0
mirror of https://github.com/autistic-symposium/master-algorithms-py.git synced 2025-04-29 20:26:07 -04:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
marina 2023-08-07 17:00:38 -07:00 committed by GitHub
parent e84d63ff68
commit d61684057c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 11 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
dynamic_programming/README.md
View File

@ -23,6 +23,17 @@
* one or more base cases (a terminating scenario that does not use recursion to produce an answer) * one or more base cases (a terminating scenario that does not use recursion to produce an answer)
* a set of rules, also known as a recurrence relation, that reduces all other cases towards the base case. * a set of rules, also known as a recurrence relation, that reduces all other cases towards the base case.
<br>
```python
def fib(n):
if n <= 1:
return n
return fib(n - 1) + fib(n - 2)
```
<br>
* there can be multiple places where the function may call itself. * there can be multiple places where the function may call itself.
* any recursion problem can be solved iteratively and vice-versa. * any recursion problem can be solved iteratively and vice-versa.