On the average‐case complexity of Shellsort
Author:
- 13 November 2017
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 52 (2) , 354-363
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- An Introduction to Kolmogorov Complexity and Its Applications2008
- A lower bound on the average-case complexity of shellsortJournal of the ACM, 2000
- Shellsort with three incrementsRandom Structures & Algorithms, 1997
- The Worst Case in Shellsort and Related AlgorithmsJournal of Algorithms, 1993
- Short Note: Empirical study of the expected running time of ShellsortThe Computer Journal, 1991
- Improved upper bounds on shellsortJournal of Computer and System Sciences, 1985
- An analysis of (h, k, 1)-ShellsortJournal of Algorithms, 1980
- An empirical study of minimal storage sortingCommunications of the ACM, 1963
- A high-speed sorting procedureCommunications of the ACM, 1959