Dynamic programming remembers old answers.
Save answers to small repeated problems, then use them to solve one big problem.
Build things
that matter.
Life, in frames.
View galleryRecent notes.
View all postsDynamic programming remembers old answers.
Save answers to small repeated problems, then use them to solve one big problem.
Read episodeBig O asks: how fast does the work grow?
Big O compares algorithms by watching what happens when the input gets much bigger.
Read episodeGraphs connect places, people, and ideas.
A graph is a set of dots and connections. It can model a city, a friendship, or the web.
Read episode