Anonymous user
Talk:Knapsack problem/Unbounded: Difference between revisions
no edit summary
(Dynamic quite similar algorithm wise to exhaustive?) |
No edit summary |
||
Line 6:
--[[User:Paddy3118|Paddy3118]] 05:40, 3 December 2008 (UTC)
:Yes, in theory. Dynamic programming runs in time polynomial in the size of the sack weight, sack volume, and number of types of items; whereas the exhaustive search runs in time exponential in the number of types of items. But since the number of types of items here is so small (3), you won't see much of a difference. --[[User:Spoon!|Spoon!]] 07:04, 3 December 2008 (UTC)
| |||