Q87
What is the time complexity of the brute force algorithm used to solve the Knapsack problem?
A.
O(n)
B.
O(n!)
C.
O(2n)
AnswerD.
O(n3)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board