An empirical estimation for time and memory algorithm complexities: newly developed R package

This article introduces GuessCompx which is an R package that performs an empirical estimation on the time and memory complexities of an algorithm or a function. It tests multiple increasing-sizes samples of the user's data and attempts to fit one of seven complexity functions: O(N), O(N^2), O(...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Agenis-Nevers, Marc, Bokde, Neeraj Dhanraj, Yaseen, Zaher Mundher, Shende, Mayur
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 21.10.2020
Subjects:	Algorithms Complexity Datasets Parameters
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!