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

(A) true
(B) false
(C) ---
(D) ---

💬 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.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

739

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate