I discovered that the Kendall's tau calculation in R uses all pairwise
comparisons which is O(n^2) and takes a long time for large vectors. I
implemented a O(n*log(n)) algorithm based on merge-sort. Is this of interest to
be included in core R? The code (fortran and R wrapper) is available in my
package clinfun v0.9.7 (not exported in NAMESPACE).
Thanks,
Venkat
--
Venkatraman E. Seshan, Ph.D. | Attending Biostatistician
Director of Biostatistics Computer-Intensive Support Services
Department of Epidemiology and Biostatistics | MSKCC
307 E 63rd St 3rd Floor | New York, NY 10065
Phone: 646-735-8126 | Fax: 646-735-0010
=====================================================================
Please note that this e-mail and any files transmitted with it may be
privileged, confidential, and protected from disclosure under
applicable law. If the reader of this message is not the intended
recipient, or an employee or agent responsible for delivering this
message to the intended recipient, you are hereby notified that any
reading, dissemination, distribution, copying, or other use of this
communication or any of its attachments is strictly prohibited. If
you have received this communication in error, please notify the
sender immediately by replying to this message and deleting this
message, any attachments, and all copies and backups from your
computer.
______________________________________________
R-devel@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-devel
