Homogeneous and Non Homogeneous Algorithms
Data Structures and Algorithms
2010-08-23 v1 Computational Complexity
Abstract
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous algorithms. Although both classes contain algorithms with worst and best cases, homogeneous algorithms behave uniformly on all instances. This partition clarifies in a completely mathematical way the previously mentioned terms and reveals that in classifying an algorithm as homogeneous or not best case analysis is equally important with worst case analysis.
Cite
@article{arxiv.1008.3546,
title = {Homogeneous and Non Homogeneous Algorithms},
author = {Ioannis Paparrizos},
journal= {arXiv preprint arXiv:1008.3546},
year = {2010}
}
Comments
This (full) paper was accepted for publication in the 13th Panhellenic Conference on Informatics (PCI 2009), 10-12 September 2009, Corfu, Greece (8 pages)