GuessCompx: 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'.

Version: 1.0.3
Imports: dplyr, reshape2, ggplot2, lubridate, boot
Suggests: knitr, rmarkdown
Published: 2019-06-03
Author: Marc Agenis and Neeraj Bokde
Maintainer: Marc Agenis <marc.agenis at>
License: GPL-3
NeedsCompilation: no
CRAN checks: GuessCompx results


Reference manual: GuessCompx.pdf
Vignettes: Vignette Title


Package source: GuessCompx_1.0.3.tar.gz
Windows binaries: r-devel: not available, r-release: not available, r-oldrel:
macOS binaries: r-release (arm64): GuessCompx_1.0.3.tgz, r-oldrel (arm64): GuessCompx_1.0.3.tgz, r-release (x86_64): GuessCompx_1.0.3.tgz, r-oldrel (x86_64): GuessCompx_1.0.3.tgz


Please use the canonical form to link to this page.