Package: GuessCompx
Type: Package
Title: Empirically Estimates Algorithm Complexity
Version: 1.0.3
Author: Marc Agenis <marc.agenis@gmail.com> and Neeraj Bokde <neerajdhanraj@gmail.com>
Maintainer: Marc Agenis <marc.agenis@gmail.com>
Description: 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'.
BugReports: https://github.com/agenis/GuessCompx/issues
URL: https://github.com/agenis/GuessCompx
License: GPL-3
Encoding: UTF-8
LazyData: true
RoxygenNote: 6.1.1
Imports: dplyr, reshape2, ggplot2, lubridate, boot
Suggests: knitr, rmarkdown
VignetteBuilder: knitr
NeedsCompilation: no
Packaged: 2019-05-31 12:02:07 UTC; Neeraj
Repository: CRAN
Date/Publication: 2019-06-03 12:50:34 UTC
Built: R 4.0.2; ; 2020-07-17 01:00:37 UTC; unix
