Answered: Suppose we are given an array of…

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

Question

Suppose we are given an array of numbers A[0], A[2], . . . , A[n - 1]. You may assume that n is a multiple of
6. We wish to find a number x that simultaneously satisfies two properties: First, x should be in the middle two-thirds of
the array (in other words, x = A[i] for some n/6 <= i < 5n/6). Second, after sorting the array, x should still be in the middle
two-thirds.
2a) Prove that such an x exists. (Hint: how many values are not in the middle two-thirds of the original array? How many
are not in the middle two-thirds of the sorted array?)
2b) Describe a linear time algorithm for finding such an x. (Note, if your solution calls one of the algorithms described in
the lectures, you should just refer to it by name, e.g. “quicksort”, rather than explaining how it works.)

Expert Solution

Trending now

This is a popular 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