21. (a) Suppose we are given two sorted arrays A[1.n] and B[1..n]. Describe an algorithm to find the median element in thè union of A and B in O(logn) time. You can assume that the arrays contain no duplicate elements.
21. (a) Suppose we are given two sorted arrays A[1.n] and B[1..n]. Describe an algorithm to find the median element in thè union of A and B in O(logn) time. You can assume that the arrays contain no duplicate elements.
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
Both pictures are the same question and can you answer parts A-D
![21. (a) Suppose we are given two sorted arrays A[1 ..n] and B[1..n]. Describe
an algorithm to find the median element in thė union of A and B in
Ə(log n) time. You can assume that the arrays contain no duplicate
elements.
UTF-8 4 space
PC
g00
000
F4
F5
F6
F7
F8
F9
FIC
&
*
4
5
7
8.
9
Y
U
F
G
H
K
L
V
N
B](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbaf1147a-1b2c-4b77-8eec-ace798575e8d%2Fac51e894-8e89-4ef9-a071-54cab876e968%2Flk1tgogp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:21. (a) Suppose we are given two sorted arrays A[1 ..n] and B[1..n]. Describe
an algorithm to find the median element in thė union of A and B in
Ə(log n) time. You can assume that the arrays contain no duplicate
elements.
UTF-8 4 space
PC
g00
000
F4
F5
F6
F7
F8
F9
FIC
&
*
4
5
7
8.
9
Y
U
F
G
H
K
L
V
N
B
![(1) Question 1: Problem 21a of [Erickson], page 55. For simplicity, assume n is power
of 2 (which means that n/2 is always an integer) and define the median to be the
one with rank n (i.e., nth smallest) in AU B. Note that AUB has 2n elements.
The median must be larger than exactly n – 1 elements and smaller than n other
elements. The problem also assumes that all elements are distinct.
Let C = A(1...n/2), D = A[n/2+1... n], E = B[1...n/2], F = B[n/2+1...n).
You.may break the solutions into smaller parts by answering the following sub-
questions.
(a) Show that if A[n/2] < B[n/2], then the median of AUB must be in DUE.
(b) Furthermore, show that the median of AUB must also be the median of DUE.
(c) By symmetry, what can you say about the case A[n/2] > B[n/2]?
(d) Design a divide-and-conquer algorithm based on the above observation. Show
that it runs in O(log n) time.
000
000
F4
F5
F6
E7
F8
F9
$
4
%
&
5
7
8
9
R
Y
U
G |
H
K
くo
F.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbaf1147a-1b2c-4b77-8eec-ace798575e8d%2Fac51e894-8e89-4ef9-a071-54cab876e968%2Fyzezevr_processed.jpeg&w=3840&q=75)
Transcribed Image Text:(1) Question 1: Problem 21a of [Erickson], page 55. For simplicity, assume n is power
of 2 (which means that n/2 is always an integer) and define the median to be the
one with rank n (i.e., nth smallest) in AU B. Note that AUB has 2n elements.
The median must be larger than exactly n – 1 elements and smaller than n other
elements. The problem also assumes that all elements are distinct.
Let C = A(1...n/2), D = A[n/2+1... n], E = B[1...n/2], F = B[n/2+1...n).
You.may break the solutions into smaller parts by answering the following sub-
questions.
(a) Show that if A[n/2] < B[n/2], then the median of AUB must be in DUE.
(b) Furthermore, show that the median of AUB must also be the median of DUE.
(c) By symmetry, what can you say about the case A[n/2] > B[n/2]?
(d) Design a divide-and-conquer algorithm based on the above observation. Show
that it runs in O(log n) time.
000
000
F4
F5
F6
E7
F8
F9
$
4
%
&
5
7
8
9
R
Y
U
G |
H
K
くo
F.
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 2 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.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