Practical variations of shellsort
Information Processing Letters
Information Processing Letters
The worst case in Shellsort and related algorithms
Journal of Algorithms
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
A lower bound on the average-case complexity of shellsort
Journal of the ACM (JACM)
Analysis of Shellsort and Related Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
Information Processing Letters
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Energy aware data management on AVR micro controller based systems
ACM SIGSOFT Software Engineering Notes
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Register level sort algorithm on multi-core SIMD processors
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
| Hi-index | 0.89 |
We consider two variants of Shellsort --- Dobosiewicz sort and Shaker sort. Not much is known about the running time of these algorithms. We prove that the worst-case time of Shaker sort is O(n3/2log3n) for certain sequences of increments and the average-case time for both variants is &Ohgr;(n2/cp) where p is the number of increments and c = 2 for Dobosiewicz sort and c = 4 for Shaker sort. In our proofs we adapt techniques and results from analysis of Shellsort.