Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 8: Problem 33

Let \(S\) and \(T\) be two arrays of \(n\) numbers that are already in nondecreasing order. Write an algorithm that finds the median of all \(2 n\) numbers whose time complexity is in \(\Theta(\lg n)\)

Short Answer

Expert verified
The median of the combined array of S and T can be found using a divide and conquer approach, comparing medians of arrays and discarding nearly half of the elements in each iteration. This will consistently reduce the scope of our problem to find a median by half until the base cases are reached, providing us with logarithmic time complexity, \(\Theta(\lg n)\).

Step by step solution

01

Define method

Define a method, call it 'getMedian', which can recursively work on two arrays and their halved parts. This method will take two arrays (S, T), and their size (n) as inputs.
02

Base Cases

Consider the following base cases: 1) If size of the arrays is 2, then the median is obtained by calculating the average of maximum of the first elements and minimum of the second elements. 2) If size of the arrays is 1, then the median is obtained by calculating the average of the two array elements.
03

Recursive Case

If size of the arrays is greater than 2, find the median of both arrays, say 'm1' for S and 'm2' for T. If 'm1' is equal to 'm2', then 'm1' or 'm2' is the median. If 'm1' is less than 'm2', then the median is present in one of the following two subarrays:[From first element of S to m1, From m2 to last element of T]. If 'm1' is greater than 'm2', then the median is present in one of the following two subarrays:[From m1 to last element of S, From first element of T to m2]. And the arrays are halved in each recursive call.
04

Continue Recursion

Halve the arrays based on the comparison of medians and recursively call the 'getMedian' method until you reach base conditions. The recursion helps in reducing the problem size by half in each recursive call, giving us the required time complexity.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Show that the median of five numbers can be found by making six comparisons.

Write an algorithm that creates a \(3-2\) tree from a list of keys. Analyze your algorithm, and show the results using order notation.

Let \(S\) and \(T\) be two arrays of \(m\) and \(n\) elements, respectively. Write an algorithm that finds all the common elements and stores them in an array \(U\) Show that this can be done in \(\Theta(n+m)\) time.

Use induction to show that \(W(n) \in \Omega(n \lg n)\) for the following recurrence This is Recurrence 8.2 in Section 8.5 .4 where \(m\) (group size) is 3 $$W(n)=W\left(\frac{2 n}{3}\right)+W\left(\frac{n}{3}\right)+\frac{5 n}{3}$$

Write an algorithm that finds the largest key in a binary search tree. Analyze your algorithm, and show the results using order notation.
See all solutions

Recommended explanations on Computer Science Textbooks

Big Data

Read Explanation

Issues in Computer Science

Read Explanation

Computer Organisation and Architecture

Read Explanation

Data Representation in Computer Science

Read Explanation

Algorithms in Computer Science

Read Explanation

Computer Network

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free