Homogeneous and Non-homogeneous Algorithms
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.1 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.
Key wordsAlgorithm analysis Algorithm complexity Algorithm classification
We thank an anonymous referee for useful suggestions and for bringing to our attention the reference .
- 6.Edelkamp, S., Wegener, I.: On the performance of weak heasort, STACS. Lecture Notes in Computer Science, pp. 254–266. Springer, Berlin (2000)Google Scholar
- 7.Edelkamp, S., Stiegeler, P.: Implementing heapsort with nlogn − 0. 9n and quicksort with nlogn + 0. 2n comparisons. ACM J. Exp. Algorithmics (JEA) 7(1), 1–20 (2002)Google Scholar
- 12.Hoare, A.: Quicksort. Comp. J. 5, 10–15 (1962) sGoogle Scholar
- 14.Nadel, B.A.: The consistent labeling problem and its algorithms: Towards exact-case complexities and theory-based heuristics. Ph.D. dissertation, Department of Computer Science, Rutgers University, New Brunswick, NJ, May (1986)Google Scholar
- 15.Nadel, B.A.: The complexity of constraint satisfaction in Prolog. In: Proceedings of the 8th National Conference Artificial Intell. (AAAI‘90)pp. 33–39, Boston, MA, August 1990. An expanded version is available as Technical Report CSC-89-004, Department of Computer Science, Wayne State University, Detroit, MI (1989)Google Scholar
- 18.Nudel, B.A.: Solving the general consistent labeling (or constraint satisfaction) problem: two algorithms and their expected complexities. In: Proceedings of the 3rd National Conference Artificial Intell. (AAAI‘83), pp. 292–296, Washington, DC, Aug (1983)Google Scholar
- 19.Paparrizos, I.: Homogeneous and non-homogeneous algorithms. In: Proceedings of the 13th Panhellenic Conference on Informatics (PCI’09), September (2009)Google Scholar
- 21.Wang, X.D., Wu, Y.J.: An improved heapsort algorithm with nlogn − 0. 788928n comparisons in the worst case. J. Comp. Sci. Tech. 22(6), 898–903 (2007)Google Scholar
- 22.Williams, J.W.J.: Algorithm 232: heapsort. Comm. ACM 6, 347–348 (1964)Google Scholar