Suppose you are given an input set S of n numbers, and a target integer k, and want to find a subset of the elements of S whose sum is exactly k.
View the step-by-step solution to:

Question

 Suppose you are given an input set S of n numbers, and a target integer k, and want to find a subset of the

elements of S whose sum is exactly k. Further you are given a black box that if given any set of numbers C and integer t instantly and correctly answers true/false whether there is a subset of C whose sum is exactly t. Show how to use the black box O(n) times to find a subset of numbers of S that adds up to k.

Top Answer

Sign up to view the full answer

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

-

Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question