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 ? Cheers, Hanson Char --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
