undefined | Better HN

0 pointsgauravsc14y ago0 comments

We are using Dynamic programming and you are correct, knapsack is a problem but since the most common solution(and widely used) is using DP, we sometimes intermittently use the term Knapsack algorithm with DP algorithm to solve Knapsack problem.

0 comments

3 comments · 1 top-level

ColinWright14y ago· 2 in thread

Right, that makes sense. Thank you.

What would happen if I encoded a large integer factorization instance into a Knapsack Problem and called your system?

DennisP14y ago

Given that it's a jquery plugin, you'd probably get a "script on this page is running slowly" message.

vog14y ago

This answer completely misses the point. Of course the algorithm could run "forever", thus triggering browser timeouts.

But it could as well terminate early, providing a suboptimal but fast solution.

j / k navigate · click thread line to collapse