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

Package details

AuthorMarc Agenis <> and Neeraj Bokde <>
MaintainerMarc Agenis <>
Package repositoryView 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.

GuessCompx documentation built on June 3, 2019, 5:04 p.m.