Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
C++ Data Structures and Algorithm Design Principles

You're reading from   C++ Data Structures and Algorithm Design Principles Leverage the power of modern C++ to build robust and scalable applications

Arrow left icon
Product type Paperback
Published in Oct 2019
Publisher
ISBN-13 9781838828844
Length 626 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (4):
Arrow left icon
John Carey John Carey
Author Profile Icon John Carey
John Carey
Anil Achary Anil Achary
Author Profile Icon Anil Achary
Anil Achary
Shreyans Doshi Shreyans Doshi
Author Profile Icon Shreyans Doshi
Shreyans Doshi
Payas Rajan Payas Rajan
Author Profile Icon Payas Rajan
Payas Rajan
Arrow right icon
View More author details
Toc

Table of Contents (11) Chapters Close

Preface 1. Lists, Stacks, and Queues FREE CHAPTER 2. Trees, Heaps, and Graphs 3. Hash Tables and Bloom Filters 4. Divide and Conquer 5. Greedy Algorithms 6. Graph Algorithms I 7. Graph Algorithms II 8. Dynamic Programming I 9. Dynamic Programming II Appendix

9. Dynamic Programming II

Learning Objectives

By the end of this chapter, you will be able to:

  • Describe how problems can be solved in polynomial versus non-deterministic polynomial time and the effect this has on our ability to develop efficient algorithms
  • Implement solutions for both the 0-1 and unbounded variants of the knapsack problem
  • Apply the concept of state space reduction to dynamic programming problems
  • Determine every shortest path in a weighted graph using approaches that have been optimized by the dynamic programming paradigm

In this chapter, we will build upon our understanding of the dynamic programming approach and examine how it can be used to optimize the problems we discussed in the previous chapter.

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at ₹800/month. Cancel anytime
Visually different images