Now suppose that you are given two unsorted arrays A and B, con-taining m and n elements respectively. You are also given a blackbox O(n) selection algorithm SEL that can be called on A and Bseparately and, in addition, a small number (say, ten) of extra mem-ory words that can be used to store some extra data. Using SELas a subroutine, design an O(n + m) algorithm for finding the kthsmallest element in the combined set of O(m + n) elements.You may not merge the two arrays in another array and call an algo-rithm (either SEL or something you wrote) on this third array. Thisis because there is no extra memory available to build this third array. (b) Now suppose that you are given two unsorted arrays A and B, con-taining m and n elements respectively. You are also given a blackbox O(n) selection algorithm SEL that can be called on A and Bseparately and, in addition, a small number (say, ten) of extra mem-ory words that can be used to store some extra data. Using SELas a subroutine, design an O(n + m) algorithm for finding the kthsmallest element in the combined set of O(m + n) elements.You may not merge the two arrays in another array and call an algo-rithm (either SEL or something you wrote) on this third array. Thisis because there is no extra memory available to build this third array.

The SEL algorithm is called for each array, A and B. Iterate till the sum of index is less than k.…

Answered: selection algorithm SEL that can be…

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

See similar textbooks

Related questions

Concept explainers

Question

Now suppose that you are given two unsorted arrays A and B, con-
taining m and n elements respectively. You are also given a black
box O(n) selection algorithm SEL that can be called on A and B
separately and, in addition, a small number (say, ten) of extra mem-
ory words that can be used to store some extra data. Using SEL
as a subroutine, design an O(n + m) algorithm for finding the kth
smallest element in the combined set of O(m + n) elements.
You may not merge the two arrays in another array and call an algo-
rithm (either SEL or something you wrote) on this third array. This
is because there is no extra memory available to build this third array.

(b) Now suppose that you are given two unsorted arrays A and B, con-
taining m and n elements respectively. You are also given a black
box O(n) selection algorithm SEL that can be called on A and B
separately and, in addition, a small number (say, ten) of extra mem-
ory words that can be used to store some extra data. Using SEL
as a subroutine, design an O(n + m) algorithm for finding the kth
smallest element in the combined set of O(m + n) elements.
You may not merge the two arrays in another array and call an algo-
rithm (either SEL or something you wrote) on this third array. This
is because there is no extra memory available to build this third array.

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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