Tag Archives: KNAPSACK problem

Give a nondeterministic polynomial time algorithm for the SUM OF SUBSETS problem. Define the transformation from the PARTITION problem to the SUM OF SUBSETS problem.

Let X(1..n) and Y(1..n) contain two lists of n integers, each sorted in nondecreasing order. Give the best (worst-case complexity) algorithm that you can think for finding (a) the largest integer of all 2n combined elements. (b) the second largest integer of all 2n combined elements. (c) the median (or the nth smallest integer) of […]