> Of course it depends. Getting the ball rolling is probably not best done by giving an NP-complete problem (subset sum) as a first exercise.
2 things:
1) Being asked to solve an NP-complete problem would actually be very simple for a person with CS knowledge - just brute force it! Your solution will be reasonably close to the best-known algorithm for arbitrary input.
2) That isn't actually the subset-sum problem since they are specifying that the subset must be of size n.
2 things:
1) Being asked to solve an NP-complete problem would actually be very simple for a person with CS knowledge - just brute force it! Your solution will be reasonably close to the best-known algorithm for arbitrary input.
2) That isn't actually the subset-sum problem since they are specifying that the subset must be of size n.