0 votes 0 votes Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) . solve the given knapsack problem applying greedy algorithm. Algorithms algorithms knapsack-problem greedy-algorithm + – LavTheRawkstar asked Apr 15, 2017 • edited Nov 10, 2018 by Lakshman Bhaiya LavTheRawkstar 4.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes hope it helps... akash.dinkar12 answered Apr 15, 2017 • selected Apr 15, 2017 by LavTheRawkstar akash.dinkar12 comment Share Follow See all 0 reply Please log in or register to add a comment.