Fractional knapsack problem is solved most efficiently by which of the following algorithm?
Posted: Wed Jul 13, 2022 7:40 pm
a) Divide and conquer
b) Dynamic programming
c) Greedy algorithm
d) Backtracking
b) Dynamic programming
c) Greedy algorithm
d) Backtracking