Question: One form of the knapsack problem is as follows: We are given a set of integers A = a1, a2, . . . , aN
One form of the knapsack problem is as follows: We are given a set of integers A = a1, a2, . . . , aN and an integer K. Is there a subset of A whose sum is exactly K?
a. Give an algorithm that solves the knapsack problem in O(NK) time.
b. Why does this not show that P = NP?
Step by Step Solution
3.32 Rating (158 Votes )
There are 3 Steps involved in it
a A dynamic programming solution resolves part a Let FITS i s be 1 if a subset of the ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1486-C-S-A(547).docx
120 KBs Word File
