Dynamic programming: Difference between revisions

@@ Line 1: / Line 1: @@
 <!--
-"Dynamic programming" is a term that amounts to we reduce the input to data we then work on.
+In an overly-broad sense, "dynamic programming" is sometimes used in "what exactly it will execute depends in part on the data we handed in this time" in any sense.
-It often suggests optimization problems to which there ''may'' be no best solution and this is merely a very practical approach,
-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].
+...but that describes so much code that the term is usually more specific.
+(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)).
-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).
+It often suggests optimization problems that are best tackled by transforming the question into some data to be handled by subtasks.
+To which there ''may'' be no best solution and this is merely a very practical approach,
+: 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].
 -->

Revision as of 13:50, 4 September 2023