GuessCompx
1.0.3Empirically Estimates Algorithm Complexity
Overview
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'.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 0%
Downloads
Dependencies
Nothing depends on this yet.
Code & Tests
- Cyclomatic complexity
- 3.0 median / 18 max
Test coverage
Line coverage
–
Expression
–
Tests / Examples
–
Functions
6 2 exported
Complexity
5.7 avg / 18 max
Call network
6 nodes / 4 edges
Test coverage has not been measured for this package yet; nodes fall back to a neutral fill.
Call graph
Open call graph →Lowest coverage
Per-function coverage is not measured for this package yet.
People & History
1 release. R releases are shown for context.
- RR 4.3.0 released · 2023-04-21
- archivedRemoved from CRAN2022-05-23check issues were not corrected despite reminders
- RR 4.2.0 released · 2022-04-22
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- 1.0.32019-06-03
- RR 3.6.0 released · 2019-04-26
Package metadata
- Total releases
- 1
- License
- GPL-3 OSI
- Download size
- not tracked yet
- Installed size
- not tracked yet
- With dependencies
- not tracked yet