Back to Discover
💻

Dynamic programming

technology Maturity 9-11

Some big jobs are hard.

Shortest path optimal substructure.svg
Shortest path optimal substructure.svg
You can break them down. Make many small jobs instead. This helps you find the best way. It makes big jobs easy. Do you like solving puzzles?

36 words
🖼️ Images & Media (4)
File:Shortest path optimal substructure.svg
Shortest path optimal substructure.svg
File:Fibonacci dynamic programming.svg
Fibonacci dynamic programming.svg
File:Tower of Hanoi.jpeg
Tower of Hanoi.jpeg
File:Tower of Hanoi 4.gif
Tower of Hanoi 4.gif
Up Next
💻
Divide-and-conquer algorithm
Technology
→
More to explore

✨ What else?

Related topics you might enjoy

Divide-and-conquer algorithm 0% Recursion (computer science) 0% Deterministic algorithm 0% Theoretical computer science 0% Automata theory 0% Theory of computation 0%

🔬 Go deeper

More advanced topics to explore

Divide-and-conquer algorithm Mathematical optimization Prim's algorithm

🪜 Step back

Simpler topics to build understanding

Held–Karp algorithm Bellman–Ford algorithm Ellipsoid method Fermat's principle
📚 Content adapted from Wikipedia | Readability: FK 12.3 | Vital Level 5