CRAN
GuessCompx 1.0.3
Empirically Estimates Algorithm Complexity
Released Jun 3, 2019 by Marc Agenis
This package cannot yet be used with Renjin because there was a problem building the package using Renjin's toolchain. View Build Log
Dependencies
lubridate 1.7.4 ggplot2 3.2.0 dplyr 0.8.2 boot 1.3-22 reshape2 1.4.3
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'.