×
Erkiö, Hannu

A heuristic approximation of the worst case of shellsort. (English) Zbl 0428.68071

BIT, Nord. Tidskr. Inf.-behandl. 20, 130-136 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0428.68071

Cited in 1 Document

MSC:

68P10 Searching and sorting

Keywords:

shellsort; worst case analysis; internal sorting; heuristic approximation; combinatorial optimization
Cite Review PDF
Full Text: DOI

References:

[1] H. Erkiö,On the worst case of Shellsort, Report C-1980-54, University of Helsinki, Department of Computer Science, 1980. · Zbl 0428.68071
[2] B. L. Golden,A statistical approach to the TSP, Networks 7,3 (1977), 209–225. · Zbl 0398.90103 · doi:10.1002/net.3230070303
[3] E. J. Gumbel,Statistics of Extremes, Columbia University Press, New York, 1958. · Zbl 0086.34401
[4] T. N. Hibbard,An empirical study of minimal storage sorting, Comm. ACM 6,5 (May 1963), 206–213. · Zbl 0112.08501 · doi:10.1145/366552.366557
[5] D. E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching (2nd printing). Addison-Wesley, 1975.
[6] V. Pratt,Shellsort and sorting networks, Ph. D. Thesis. Stanford University, 1972.
[7] D. L. Shell,A high-speed sorting procedure, Comm. ACM 2,7 (July 1959), 30–32. · doi:10.1145/368370.368387
[8] Yu. G. Stoyan and V. Z. Socolovsky,The minimization method for some permutation functionals, Information Processing Letters 8,2 (Feb. 1979), 110–111. · doi:10.1016/0020-0190(79)90157-1
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.