The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
496 views
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.7k points)
edited by | 496 views

1 Answer

+2 votes
Best answer

hope it helps...

by Boss (41.3k points)
selected by

Related questions

+6 votes
2 answers
1
asked Jan 21, 2017 in Algorithms by Sarvottam Patel Junior (965 points) | 557 views
0 votes
1 answer
7
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
49,830 questions
54,800 answers
189,506 comments
80,731 users