@article{henglein2009sorting,
  abstract = {What is a sorting function—not a sorting function for a given ordering relation, but a sorting function with nothing given? Formulating four basic properties of sorting algorithms as defining requirements, we arrive at intrinsic notions of sorting and stable sorting: A function is a sorting function if and only it is an intrinsically parametric permutation function. It is a stable sorting function if and only if it is an intrinsically stable permutation function. We show that ordering relations can be represented isomorphically as inequality tests, comparators and stable sorting functions, each with their own intrinsic characterizations, which in turn provide a basis for run-time monitoring of their expected I/O behaviors. The isomorphisms are parametrically polymorphically definable, which shows that it is sufficient to provide any one of the representations since the others are derivable without compromising data abstraction. Finally we point out that stable sorting functions as default representations of ordering relations have the advantage of permitting linear-time sorting algorithms; inequality tests forfeit this possibility.},
  author = {Henglein, Fritz},
  interhash = {6d54b43dd143a9da6bbb2b98dc1d17be},
  intrahash = {0ecd29a882b7917c1633bc4f817428f6},
  journal = {Journal of Logic and Algebraic Programming},
  month = {1},
  number = 7,
  title = {What is a Sorting Function?},
  uniqueid = {S1567832608001094|edselp},
  volume = 78,
  year = 2009
}

@misc{khamitka2009folklore,
  abstract = {The objective of this paper is to review the folklore knowledge seen in research work devoted on synthesis, optimization, and effectiveness of various sorting algorithms. We will examine sorting algorithms in the folklore lines and try to discover the tradeoffs between folklore and theorems. Finally, the folklore knowledge on complexity values of the sorting algorithms will be considered, verified and subsequently converged in to theorems.},
  author = {Khamitka, Santosh and Bhalchandra, Parag and Lokhande, Sakharam and Deshmukh, Nilesh},
  interhash = {18d6db8831aaa6a361f6ea471bb44954},
  intrahash = {fd29675b0e34296757bca824fa92d6e5},
  month = {9},
  title = {The Folklore of Sorting Algorithms},
  uniqueid = {cog.6714|edscog},
  year = 2009
}

@article{franceschini2005inplace,
  abstract = {We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously. [ABSTRACT FROM AUTHOR]},
  author = {Franceschini, Gianni and Geffert, Viliam},
  interhash = {6811ae48c9759f7a67eb6cbf48e06296},
  intrahash = {85343dde3d3317cc952a4b70ffee58c7},
  journal = {Journal of the ACM},
  month = {7},
  number = 4,
  title = {An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.},
  uniqueid = {18067174|buh},
  volume = 52,
  year = 2005
}

@misc{mn1987sorting,
  abstract = {Computers and the tasks they perform are becoming increasingly important in medicine. It behooves medical personnel to become familiar with some computer functions so that they may be in a better position to demand and evaluate a given implementation. One very basic computer task is sorting information. Some general principles of computing efficiency are discussed, as well as the standard "O" notation. A simple sort, bubblesort, is discussed and analyzed. A second elementary sort, insertionsort, is considered in relation to its more sophisticated descendant, shellsort. The most efficient in-memory sort, quicksort (and its various descendants), is likewise examined, and the advantages and disadvantages of each variant are discussed in some detail, as well as methods that may enhance speed and resource utilization. Finally, mergesort, which is used in sorting large files resident in mass-storage devices, is discussed, along with its particular advantages.},
  author = {MN, Skaredoff},
  interhash = {b801a748477ac40e51cc3cda657e55e1},
  intrahash = {7407e011027586d60c6d21f99926ff74},
  journal = {Journal Of Clinical Monitoring},
  month = {7},
  number = 3,
  title = {Sorting efficiency.},
  uniqueid = {3612218|cmedm},
  volume = 3,
  year = 1987
}

@article{dobosiewicz1980efficient,
  author = {Dobosiewicz, Wlodzimierz},
  interhash = {871521972819cf2a12a253a835242437},
  intrahash = {7e6ae30aca4066bc7da59f71ab013f66},
  journal = {Information Processing Letters},
  month = {1},
  number = 1,
  title = {An efficient variation of bubble sort},
  uniqueid = {0020019080900228|edselp},
  volume = 11,
  year = 1980
}