# Given an unordered sequence S of n comparable elements, describe a lineartime method for finding the [n ] items whose rank in an ordered version of S is closest to that of the median.

Chapter 9, Creativity #7

Given an unordered sequence S of n comparable elements, describe a lineartime method for finding the [√n ] items whose rank in an ordered version of S is closest to that of the median.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

**Related Book For**

## Algorithm Design And Applications

1st Edition

**Authors:** Michael T. Goodrich, Roberto Tamassia

**ISBN:** 9781118335918