Time complexity of fractional knapsack problem is ____________
(a) O(n log n)
(b) O(n)
(c) O(n^2)
(d) O(nW)
This question was posed to me in semester exam.
I need to ask this question from Greedy Algorithms in section Greedy Algorithms of Data Structures & Algorithms II