mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 20:26:07 -04:00
Update README.md
This commit is contained in:
parent
22adc6f880
commit
f5490128cd
@ -1,16 +1,4 @@
|
||||
## math, logic, dynamic programming
|
||||
|
||||
<br>
|
||||
|
||||
### dynamic programming
|
||||
|
||||
<br>
|
||||
|
||||
* take a recursive algorithm and cache overlapping problems (repeated calls).
|
||||
* the runtime is given by the number of calls.
|
||||
* **top-down**: how can we divide the problem into sub-problems?
|
||||
* top-down dynamic programming is called **memoization**.
|
||||
* **bottom-up**: solve for a simple case, then figure out for more elements.
|
||||
## math
|
||||
|
||||
<br>
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user