From the course: Advanced Algorithmic Thinking with Python
Unlock this course with a free trial
Join today to access over 25,500 courses taught by industry experts.
Challenge: The knapsack problem - Python Tutorial
From the course: Advanced Algorithmic Thinking with Python
Challenge: The knapsack problem
(pleasant electronic music) - [Instructor] Here's a challenge for the 0/1 Knapsack problem. On the slide, we have a table with some values and some weights and we filled in the zeros and your task is to fill in the rest of the cells using the procedure we discussed in the video on the 0/1 Knapsack problem. The formula on this slide is going to be your friend, so if at any point you forget what you're doing, refer back to this formula, and it should make clear what the next step is. Okay, good luck with this challenge, and we'll give you the solution in the next video.
Contents
-
-
-
-
-
-
Introduction to dynamic programming56s
-
(Locked)
Top-down dynamic programming example2m 26s
-
(Locked)
Bottom-up dynamic programming example47s
-
(Locked)
The knapsack problem: Theory5m 7s
-
(Locked)
The knapsack problem: Python implementation3m 54s
-
(Locked)
Challenge: The knapsack problem36s
-
(Locked)
Solution: The knapsack problem16s
-
-
-