Lecture 13: Dynamic Programming - Knapsack Problem

In this lecture we continue a new example that can be solved using the algorithmic paradigm of dynamic programming. This lecture treats the knapsack problem (the discrete version) that can be solved in time O(nW), where n is the number of items and W is the maximum capacity of the knapsack. The instruction language is Arabic, however, all material, slides, formulations, definitions, etc., are all given in English.