Question: Suppose you are given two sets A and B, each containing n positive integers. You can choose to reorder each set however you like. After
Suppose you are given two sets A and B, each containing n positive integers. You can choose to reorder each set however you like. After reordering, let ai be the ith element of set A, and let bi be the ith element of set B. You then receive a payoff of. Give an algorithm that will maximize your payoff. Prove that your algorithm maximizes the payoff, and state its running time.
Step by Step Solution
3.22 Rating (169 Votes )
There are 3 Steps involved in it
Sort A and B into monotonically decreasing order Heres a proof that this m... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (118).docx
120 KBs Word File
