2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/33128We 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 $Ω(pn^{1 + 1/p)$ for all $p \leq \log n$. Using similar arguments, we analyze the average-case complexity of several other sorting algorithms.11 pages. Submitted to ICALP'99Data Structures and AlgorithmsComputational ComplexityF.2.2; F.1.3text