dynamic programming - mmedrano9438/peripheral-brain GitHub Wiki

  • Dynamic programming entails breaking the problem down into smaller sub-problems and saving the solutions in a table for later use, as opposed to recursion, which involves breaking the problem down into smaller sub-problems and solving them recursively.
  • Dynamic programming is commonly used to solve shortest /and or longest path problems, such as finding the shortest path between two points in a graph.