Anonymous user
Talk:Knapsack problem/Unbounded: Difference between revisions
→Terrible numbers: new section
(→Terrible numbers: new section) |
|||
Line 44:
You need to go the extra mile and reduce the output to the ''very'' "best", as the task description requires. --[[User:Paddy3118|Paddy3118]] 06:59, 30 October 2010 (UTC)
== Terrible numbers ==
With the numbers given, dynamic programming didn't produce a single cache hit. Basically the given data is perfect for brute force, and a very easy one at that. Probably not worth all the discussions about big-O as is. --[[User:Ledrug|Ledrug]] 02:01, 11 June 2011 (UTC)
| |||