Can we convert a Knapsack problem to Logarithmic time?

后端 未结 0 1012
别那么骄傲
别那么骄傲 2020-12-13 19:32

If I want an optimal solution that is guaranteed, then the best I can do is a n^(n-1) solution as I have to evaluate every possible combination. If I want to find a good sol

相关标签:
回答
  • 消灭零回复
提交回复
热议问题