Nothing
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'.
Browse package contents
Package details |
|
|---|---|
| Author | Marc Agenis <marc.agenis@gmail.com> and Neeraj Bokde <neerajdhanraj@gmail.com> |
| Maintainer | Marc Agenis <marc.agenis@gmail.com> |
| License | GPL-3 |
| Version | 1.0.3 |
| URL | https://github.com/agenis/GuessCompx |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the GuessCompx package in your browser
Any scripts or data that you put into this service are public.
