Average-Case Complexity of Shellsort
Tao Jiang, Ming Li, Paul Vitanyi
Abstract
We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a p-pass Shellsort for any incremental sequence is Ω(pn1 + 1/p) for all p ≤ n. Using similar arguments, we analyze the average-case complexity of several other sorting algorithms.
Create a lesson
Related papers
Claw-Free and Line Graph Edge Deletion on Block Graphs
Rajat Adak
Bounded-Density Vertex Deletion Beyond Vertex Cover
Adrian Miclăuş, Alexandru Popa, Andrei Popa
Hypothesis Selection via Weighted Medians
Liang-Yu Zou
Simple, Faster (min, +) Matrix Multiplication and APSP
Barna Saha, Christopher Ye
Subexponential Parameterized Approximation for Group-Fair Euclidean k-Center
Rudranarayan Kar, Diya Roy, Abhishek Sahu
An Analytic 0.48-Approximation for Non-Monotone k-Submodular Maximization under a Matroid Constraint
Zizong Wang, Yibo Wang