After greedy and divide and conquer, we will turn our attention to dynamic programming. Dynamic programming is an algorithm design paradigm that also attempts to solve optimization problems by combining solutions with subproblems. Unlike divide and conquer, subproblems need to exhibit optimal substructure for dynamic programming to be applicable.
Understanding Dynamic Programming
by James Cutajar
Beginning Java Data Structures and Algorithms
- Title Page
- Copyright and Credits
- Packt Upsell
- Contributors
- Preface
- Algorithms and Complexities
- Sorting Algorithms and Fundamental Data Structures
- Hash Tables and Binary Search Trees
- Introducing Hash Tables
- Getting Started with Binary Search Trees
- Summary
- Algorithm Design Paradigms
- Introducing Greedy Algorithms
- Getting Started with Divide and Conquer Algorithms
- Understanding Dynamic Programming
- Summary
- String Matching Algorithms
- Graphs, Prime Numbers, and Complexity Classes
- Other Books You May Enjoy
Understanding Dynamic Programming
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.