Back tracking algorithm for 0 1 Knapsack Problem
Given n objects and knapsack of capacity m. Each object i has a weight wi and profit pi
The objective is to fill the knapsack to maximum profit but keep the total weight ≤ m
If an object i is placed in into the knapsack, then the profit of pi is earned.
The problem is solved using the Backtracking Algorithm.
Before watching this video see how to solve the 0 1 knapsack problem
• O/1 (Zero One) Knapsack Problem