Abstract
Dynamic programming involves breaking down problems into their subproblems. By solving for the optimal subproblems and saving those results into memory to access them whenever a repeated problem needs to be solved, the algorithmic complexity decreases significantly. Implementing dynamic programming algorithms requires higher-level thinking about the problem’s patterns. To explain dynamic programming, let’s re-examine the Fibonacci sequence that was discussed in Chapter 8. Then the chapter will cover the rules of dynamic programming and walk you through some examples to make the concepts more concrete.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Sammie Bae
About this chapter
Cite this chapter
Bae, S. (2019). Dynamic Programming. In: JavaScript Data Structures and Algorithms. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3988-9_19
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3988-9_19
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3987-2
Online ISBN: 978-1-4842-3988-9
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books