Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Why a lot of dynamic programming algorithms use nested lists (matrices)? #2

Closed
nbro opened this issue Jan 5, 2016 · 0 comments
Closed

Why a lot of dynamic programming algorithms use nested lists (matrices)? #2

nbro opened this issue Jan 5, 2016 · 0 comments
Labels
question A single question regarding a particular topic/concept.

Comments

@nbro
Copy link
Owner

nbro commented Jan 5, 2016 •
edited
Loading

In general, because of the nature of problems (i.e. overlapping subproblems and optimal substructure) where dynamic programming can be applied, matrices are needed to keep track of results to subproblems, etc.
@nbro nbro added enhancement question A single question regarding a particular topic/concept. labels Sep 3, 2016
@nbro nbro closed this as completed Feb 3, 2017
@nbro nbro removed the enhancement label Apr 3, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
question A single question regarding a particular topic/concept.
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@nbro