The Gateway to Computer Science Excellence
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.
in Algorithms by Active (3.8k points)
edited by | 550 views

1 Answer

+3 votes
Best answer

hope it helps...

by Boss (42.4k points)
selected by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,280 answers
104,841 users