Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

# The characterization of sort sequences

• 24 Accesses

## Abstract

A sort sequenceS n is a sequence of all unordered pairs of indices inI n = 1, 2, ...,n. With a sort sequenceS n, we associate a sorting algorithmA(S n) to sort input setX = x 1, x2, ..., xn as follows. An execution of the algorithm performs pairwise comparisons of elements in the input setX as defined by the sort sequenceS n, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let χ(S n) denote the average number of comparisons required by the algorithmA(S n assuming all input orderings are equally likely. Let χ*(n) and χ∘(n) denote the minimum and maximum values, respectively, of χ(S n) over all sort sequencesS n. Exact determination of χ*(n), χO(n) and associated extremal sort sequences seems difficult. Here, we obtain bounds on χ*(n) and χO(n).

This is a preview of subscription content, log in to check access.

## References

1. 1.

H.L. Beus,The Use of Information in Sorting, Journal of ACM17 (3) (1970), 482–495.

2. 2.

B. Bollobas and M. Rosenfield,Sorting in One Round, Israel Journal of Mathematics38 (1981), 154–160.

3. 3.

R.C. Bose and R. J. Nelson,A Sorting Problem, Journal of ACM9 (2) (1962), 282–196.

4. 4.

M.Y. Yun,Design and Analysis of Predictive Sorting Algorithms, Korean J. Comp. and Appl. Math.3 (1) (1996), 11–24.

5. 5.

F. Harary,Graph Theory, Addison Wesley, 1969.

6. 6.

P. Turan,On the Theory of Graphs, Colloq. Math.3 (1954), 19–30.

## Author information

Correspondence to Minyoung Yun.

## Rights and permissions

Reprints and Permissions

Yun, M. The characterization of sort sequences. Korean J. Comp. & Appl. Math. 4, 453–467 (1997). https://doi.org/10.1007/BF03014492