Compute a Cyclist's Eddington Number

Compute a cyclist's Eddington number, including efficiently computing cumulative E over a vector. A cyclist's Eddington number < https://en.wikipedia.org/wiki/Arthur_Eddington#Eddington_number_for_cycling> is the maximum number satisfying the condition such that a cyclist has ridden E miles or greater in E days. The algorithm in this package is an improvement over the conventional approach because both summary statistics and cumulative statistics can be computed in linear time, since it does not require initial sorting of the data. These functions may also be used for computing h-indices for authors, a metric described by Hirsch (2005) . Both are specific applications of computing the side length of a Durfee square < https://en.wikipedia.org/wiki/Durfee_square>.


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("eddington")

2.1.1 by Paul Egeler, 3 months ago


https://github.com/pegeler/eddington2


Report a bug at https://github.com/pegeler/eddington2/issues


Browse source code at https://github.com/cran/eddington


Authors: Paul Egeler [aut, cre] , Tashi Reigle [ctb]


Documentation:   PDF Manual  


GPL (>= 2) license


Imports Rcpp

Suggests testthat, knitr, rmarkdown, dplyr

Linking to Rcpp


See at CRAN