Vidyalelo
Data Structure · Q257

Miscellaneous on Data Structures

Programming · Data Structure · question 257

Q257

Time complexity of fractional knapsack problem is . . . . . . . .

A.
O(n log n)
Answer
B.
O(n)
C.
O(n2)
D.
O(nW)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board