Range Medians

Details Range Medians Range Medians

2008-07-01

arxiv.org/abs/0807.0222v1

Computer Science

Data Structures and Algorithms

To appear in ESA 08

Scientific paper

We study a generalization of the classical median finding problem to batched query case: given an array of unsorted $n$ items and $k$ (not necessarily disjoint) intervals in the array, the goal is to determine the median in {\em each} of the intervals in the array. We give an algorithm that uses $O(n\log n + k\log k \log n)$ comparisons and show a lower bound of $\Omega(n\log k)$ comparisons for this problem. This is optimal for $k=O(n/\log n)$.

Affiliated with

Also associated with

No associations

Rating

Range Medians does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Range Medians, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Range Medians will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421434