Empirically Estimates Algorithm Complexity

Make an empirical guess on the time and memory complexities of an algorithm or a function. Tests multiple, increasing size random samples of your data and tries to fit various complexity functions o(n), o(n2), o(log(n)), etc. Based on best fit, it predicts the full computation time on your whole dataset. Results are plotted with 'ggplot2'.


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("GuessCompx")

1.0.3 by Marc Agenis, a month ago


https://github.com/agenis/GuessCompx


Report a bug at https://github.com/agenis/GuessCompx/issues


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


Authors: Marc Agenis <[email protected]> and Neeraj Bokde <[email protected]>


Documentation:   PDF Manual  


GPL-3 license


Imports dplyr, reshape2, ggplot2, lubridate, boot

Suggests knitr, rmarkdown


See at CRAN