dynamic programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems. It is applicable to problems exhibiting the properties of overlapping subproblems[1] and optimal substructure. When applicable, the method takes far less time than other methods that don't take advantage of the subproblem overlap.
-
Notifications
You must be signed in to change notification settings - Fork 0
Ma5300408/Dynamic-Programming
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published