Fractional knapsack problem can be solved in time O(n).

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. Fractional knapsack problem can be solved in time O(n).

💬 Discuss

✅ Correct Answer: (A) true

Explanation: it is possible to solve the problem in o(n) time by adapting the algorithm for finding weighted medians.

it is possible to solve the problem in o(n) time by adapting the algorithm for finding weighted medians.

💬 Discussion

👁️

688

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

87%

Success Rate