Reply To:
The following paradigm can be used to find the solution of the problem in minimum time:
Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K:
(A) Divide and Conquer
(B) Dynamic Programming
(C) Greedy Algorithm
(D) Branch and Bound
nan