commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Hanson Char" <>
Subject Percentile
Date Mon, 15 Oct 2007 21:14:24 GMT
The current implementation of Percentile relies on sorting the
underlying array.  There is much faster way like the use of Hoare's
partitioning that would take only linear instead of n*ln(n) time.

Has such improvement be considered before ?  Any reason not to do so ?

Hanson Char

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message