Question: Given the following 5 objects with their respective weights and profits, and a knapsack with capacity C = 5: object 1 2 5 3 4
Given the following 5 objects with their respective weights and profits, and a knapsack with capacity C = 5:
object 1 2 5 3 4
p 20 24 26 14 15
w 1 3 4 2 5
Solve the Fractional Knapsack using the Greedy technique, showing the maximum profit and the objects (or their fractions) chosen.
What is the time complexity of the algorithm for n objects and a capacity C?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
