Dynamic programming: Difference between revisions
Jump to navigation
Jump to search
(Created page with "<!-- "Dynamic programming" is a term that amounts to we reduce the input to data we then work on. It often suggests optimization problems to which there may be no best solution. It is contrasted with "do exactly this with the input" in a way that will never behave fundamentally differently with with what data you give it. (beyond some basic if-else branching). -->") |
mNo edit summary |
||
| Line 1: | Line 1: | ||
<!-- | <!-- | ||
"Dynamic programming" is a term that amounts to we reduce the input to data we then work on. | "Dynamic programming" is a term that amounts to we reduce the input to data we then work on. | ||
It is contrasted with "do exactly this with the input" | It often suggests optimization problems to which there ''may'' be no best solution and this is merely a very practical approach, | ||
in a way that will never behave fundamentally differently with with what data you give it | but there is further typology about whether solving the sub-problems can be optimal -- see terms like [https://en.wikipedia.org/wiki/Optimal_substructure optimal substructure]. | ||
(beyond some basic if-else branching). | |||
It is often contrasted with | |||
"do exactly this with the input" in a way that will never behave fundamentally differently with with what data you give it (beyond some basic if-else branching). | |||
--> | --> | ||