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.

[1]  Y. Gurevich,et al.  What does O(n) mean , 1986, SIGA.

[2]  Ingo Wegener,et al.  On the Performance of WEAK-HEAPSORT , 2000, STACS.

[3]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[4]  Gillea Brassard,et al.  Crusade for a better notation , 1985, SIGA.

[5]  Ying-Jie Wu,et al.  An Improved HEAPSORT Algorithm with nlogn − 0.788928n Comparisons in the Worst Case , 2007, Journal of Computer Science and Technology.

[6]  Bernard A. Nadel,et al.  Precision Complexity Analysis: A Case Study using Insertion Sort , 1993, Inf. Sci..

[7]  Ronald D. Dutton,et al.  Weak-heap sort , 1993, BIT.

[8]  Bernard Nudel,et al.  Solving the General Consistent Labeling (or Constraint Satisfaction) Problem: Two Algorithms and Their Expected Complexities , 1983, AAAI.

[9]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[10]  Rudolf Fleischer,et al.  A tight lower bound for the worst case of Bottom-Up-Heapsort , 1994, Algorithmica.

[11]  B. A. Nadel.  The consistent labeling problem and its algorithm: toward exact-case complexities and theory-based heuristics , 1986 .

[12]  Bernard A. Nadel,et al.  The Complexity of Constraint Satisfaction in Prolog , 1990, AAAI.

[13]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[14]  Robert Sedgewick,et al.  The Analysis of Heapsort , 1993, J. Algorithms.

[15]  Mark Allen Weiss,et al.  Best case lower bounds for Heapsort , 2005, Computing.

[16]  Bernard A. Nadel,et al.  Representation selection for constraint satisfaction: a case study using n-queens , 1990, IEEE Expert.

[17]  Alan M. Frieze,et al.  On the Best Case of Heapsort , 1996, J. Algorithms.

[18]  Stefan Edelkamp,et al.  Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons , 2002, JEAL.

[19]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.