Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Example: If A = [3, 2, 5, 1] and B = [5,7, 2, 9], we can re-order A to [1,2,3, 5] and B to [2, 5, 7,9] to achieve 4 · (1+3+4+4) = 3, i=1 which you can also check is the miimum value.

Example: If A = [3, 2, 5, 1] and B = [5,7, 2, 9], we can re-order A to [1,2,3, 5] and B to [2, 5, 7,9] to achieve 4 · (1+3+4+4) = 3, i=1 which you can also check is the miimum value.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

hi 

Problem 2. You are given two arrays of positive integers A[1 : n] and B[1 : n]. The goal is to re-order the arrays A and B so that the average difference between entries of A and B with the same index, after the re-ordering, is minimized. In other words, we want to change the orders of numbers in A and B, so that 1 EIA[i] – B[i]| is minimized. Design an O(n log n) time greedy algorithm for this problem. Example: If A = [3, 2, 5, 1] and B = [5, 7, 2, 9], we can re-order A to [1, 2, 3, 5] and B to [2,5, 7, 9] to achieve 4 1 1 EIA|1] – B[i]| · (1+3+4+4) = 3, 4 4 i=1 which you can also check is the minimum value.
Transcribed Image Text:Problem 2. You are given two arrays of positive integers A[1 : n] and B[1 : n]. The goal is to re-order the arrays A and B so that the average difference between entries of A and B with the same index, after the re-ordering, is minimized. In other words, we want to change the orders of numbers in A and B, so that 1 EIA[i] – B[i]| is minimized. Design an O(n log n) time greedy algorithm for this problem. Example: If A = [3, 2, 5, 1] and B = [5, 7, 2, 9], we can re-order A to [1, 2, 3, 5] and B to [2,5, 7, 9] to achieve 4 1 1 EIA|1] – B[i]| · (1+3+4+4) = 3, 4 4 i=1 which you can also check is the minimum value.
Expert Solution
steps

Step by step

Solved in 5 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS