An Efficient Solution for the Generalized Median Problem

A generalized median finding problem is studied in this paper. While there are several theoretical solutions to the problem, only a few have been tried out, and there is little idea on how the others would perform. The computation model used in this paper is the RAM model with word-size T(log n). Our data structure is a practical linear space data structure that supports range selection queries in O(log n) time with O(nlogn) preprocessing time.