Displaying 1 result from an estimated 1 matches for "algol68".
2006 Mar 11
1
Quicker quantiles?
....au/R/devel/05/11/3305.html
http://tolstoy.newcastle.edu.au/R/devel/06/03/4358.html
I decided to try to revive an old project to implement a version of
the Floyd
and Rivest (1975) algorithm for finding quantiles with O(n)
comparisons. I
used to have a direct translation from FR's algol68 in my quantreg
package,
but was forced to remove it when it encountered g77 compilers that
didn't like the way I had handled recursion.
Fortunately, in the interim, I've corresponded with Krzysztof Kiwiel
in Warsaw
who has made a detailed study of the algorithm:
K.C. Kiwiel: On Floyd...