Fast computation of the median by successive binning

This paper describes a new median algorithm and a median approximation algorithm. The former has O(n) average running time and the latter has O(n) worst-case running time. These algorithms are highly competitive with the standard algorithm when computing the median of a single data set, but are significantly faster in updating the median when more data is added.

[1]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[2]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[3]  Ronald L. Rivest,et al.  Expected time bounds for selection , 1975, Commun. ACM.

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[5]  W. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .