Q428
Fractional knapsack problem is solved most efficiently by which of the following algorithm?
A.
Backtracking
B.
Greedy algorithm
AnswerC.
Dynamic programming
D.
Divide and conquer
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board