Dynamic programming: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo edit summary |
||
| Line 9: | Line 9: | ||
It often suggests optimization problems that are best tackled by transforming the question into some data to be handled by subtasks. | It often suggests optimization problems that are best tackled by transforming the question into some data to be handled by subtasks, | ||
where the way you build that intermediate data will vary with the values within that actual data. | |||
To which there ''may'' be no best solution and this is merely a very practical approach, | 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 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]. | ||
--> | --> | ||
Latest revision as of 12:58, 6 May 2024