Fast Computation of Trimmed Means

  • Beliakov G
Citations of this article
Mendeley users who have this article in their library.


© 2011, American Statistical Association. All right reserved. We present two methods of calculating trimmed means without sorting the data in O(n) time. The existing method implemented in major statistical packages relies on sorting, which takes O(n log n) time. The proposed algorithm is based on the quickselect algorithm for calculating order statistics with O(n) expected running time. It is an order of magnitude faster than the existing method for large data sets.




Beliakov, G. (2015). Fast Computation of Trimmed Means. Journal of Statistical Software, 39(Code Snippet 2).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free