Problem 3: Median of two sorted arrays. Finding the median of a sorted array is easy: return the middle element. Suppose we are given two sorted arrays A and B; the array A consists of m not necessary different integers, while B consists of n not necessary different integers. Suppose that A and B are disjoint, that is, there does not exist an element which is in A and B. (i) Describe a naive algorithm which in time O(m + n) finds the median of all integers in A and B. (ii) If m = n, describe an algorithm which in time O(log n) finds the median of all integers in A and B.
Problem 3: Median of two sorted arrays. Finding the median of a sorted array is easy: return the middle element. Suppose we are given two sorted arrays A and B; the array A consists of m not necessary different integers, while B consists of n not necessary different integers. Suppose that A and B are disjoint, that is, there does not exist an element which is in A and B. (i) Describe a naive algorithm which in time O(m + n) finds the median of all integers in A and B. (ii) If m = n, describe an algorithm which in time O(log n) finds the median of all integers in A and B.
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
Related questions
Question
Problem 3: Median of two sorted arrays. Finding the median of a sorted array is easy:
return the middle element. Suppose we are given two sorted arrays A and B; the array A
consists of m not necessary different integers, while B consists of n not necessary different
integers. Suppose that A and B are disjoint, that is, there does not exist an element which
is in A and B.
(i) Describe a naive
in A and B.
(ii) If m = n, describe an algorithm which in time O(log n) finds the median of all integers
in A and B.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
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
Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education