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