通过连续面元快速计算中值
Fast computation of the median by successive binning
摘要：
本文介绍了一种新的中值算法和一种中值近似算法。前者的平均运行时间为O（n），后者的最坏情况运行时间为O（n）。这些算法在计算单个数据集的中值时与标准算法具有很强的竞争力，但在添加更多数据时更新中值的速度要快得多。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
