![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
Fractional knapsack problem can be solved in time O(n). |
A. | true |
B. | false |
Answer» A. true | |
Explanation: it is possible to solve the problem in o(n) time by adapting the algorithm for finding weighted medians. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet