Suppose we have two arrays A[1:n] and B[1:m] which are both in sorted order and are consisting of distinct numbers. Design an algorithm that given an integer 1≤r≤m+n, find the element with rank in the union of arrays A and B. Your algorithm should run in only O(log (n+m)) time. Example. Suppose A= [1,5,7,9] and B= [2,4,6,12] and so n=m= 4. Then, the answer to r= 3 is 4 and the answer to r= 7 is 9 because the union of arrays A and B in the sorted order is [1,2,4,5,6,7,9,12]. The answers should not be code/program. Rather, it should be some pseudocode and/or English explanation with proof of correctness that leads to the run time it asks for.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Suppose we have two arrays A[1:n] and B[1:m] which are both in sorted order and are consisting of distinct numbers. Design an algorithm that given an integer 1≤r≤m+n, find the element with rank in the union of arrays A and B. Your algorithm should run in only O(log (n+m)) time.

Example. Suppose A= [1,5,7,9] and B= [2,4,6,12] and so n=m= 4. Then, the answer to r= 3 is 4 and the answer to r= 7 is 9 because the union of arrays A and B in the sorted order is [1,2,4,5,6,7,9,12].

The answers should not be code/program. Rather, it should be some pseudocode and/or English explanation with proof of correctness that leads to the run time it asks for.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Counting Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education