Question: Write any two characteristics of Greedy Algorithms. Write an algorithm for solving fractional Knapsack problem and also use it find the optimai solution to the

Write any two characteristics of Greedy Algorithms. Write an algorithm for solving fractional Knapsack problem and also use it find the optimai solution to the Knapsack instance, n=4,m=5 (w1,w2,W3,w4)=(2,1,3,2) and (P1,P2,P3,P4)=(12,10,10, 15). 2+8
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
