Dynamic Programming - Knapsack Problem Part 1

In this first part of the dynamic programming solution to the 1/0 knapsack problem, we begin laying out the early stages of our table of results.

This video assumes the viewer understands the initial knapsack problem!

[rimidalv]

Best explanation I found in the Internet to understand what is 'Knapsack Problem'.
Not sure if some professors themselves, who explain this, really know the solution.

[procaviacapensis]

Well chosen example (so the audience doesn't have to wait long before it gets interesting), and I like the way you don't lose sight of the fact that this is a dynamic programming example.

One improvement I'd suggest for the YouTube entries for parts 1 and 2 would be to include a link for the next part. (Part 2 did appear in the grid of 12 videos shown at the end, but I had to search the channel for part 3.)

[Babelfish]

I love your accent, very easy to understand and listen to :D Thanks for the great explanation, just what I needed!

[Vyath]

The solution was explained very clearly and intuitively . Thanks!

[venpul]

Very well explained. Keep up the good work mate.

[eneekmot]

You are awesome. Thank you for taking the time to slow down and explain this simple yet counterintuitive problem.

[dudeskywalker]

The explanation was very clear and easily understandable. Can you help with the psuedo code for this too?

[adrianm]

Agreed with the other comments. Best explanation I've found on the knapsack problem so far !

[Johnny-is]

Why when you have a space of 8 in the knapsack, do you not add another item of weight 4 into it, making it 2 items?

[mohammedsahil]

Any idea about knapsack problem dynamic programming using c graphics

[JamesBedford]

Thanks for the comment! Just added links to the descriptions! :)

[MrAaronsrun]

Extremely helpful good sir, the things you were saying popped into my head just as you say them, the way you explained it followed my train of thought quite well.

I'm glad you took your time on this and split the video up, other videos rush filling in the table due to time constraints.

And god damn it what a beautiful voice.

[PremKulpy]

was wondering about that too... dunno

[Aiman_Alfarah]

have u Dynamic Programming in R program for - Knapsack Problem???

[bnikolab]

I just realised it's probably because you have only 1 of the each items.

[WindowedApple]

Thanks for the upload, but learn to express the way you explain things better. You where mumbling.