Question

JAVA >>>>
The subset sum problem is as follows: Given N integers A1; : : : ;AN and
an integer K, is there a group of integers that sums exactly to K?
a) Give a recursive method solving this problem.
b) Give a method solving this problem with running time O(NK).
Your method signature would look like this:
public static boolean sum(int [] array, int n, int k)

Answer 1

is A1 to An an ordered list?

Answer 2

What did you do so far?

Answer 3

I solved it alreadythanks ... @caominhim not sorted ...