How inefficient can a sort algorithm be?
Data Structures and Algorithms
2014-06-05 v1
Abstract
We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments.
Cite
@article{arxiv.1406.1077,
title = {How inefficient can a sort algorithm be?},
author = {Miguel A. Lerma},
journal= {arXiv preprint arXiv:1406.1077},
year = {2014}
}
Comments
8 pages