Improved upper bounds on Shellsort

DOI10.1016/0022-0000(85)90042-XzbMath0583.68035OpenAlexW2035580504WikidataQ56113002 ScholiaQ56113002MaRDI QIDQ1069307

Janet Incerpi, Robert Sedgewick

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90042-x

zbMATH Keywords

sortingrunning time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (6)

More on shellsort increment sequences ⋮ The Frobenius Problem and Its Generalizations ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Lattice translates of a polytope and the Frobenius problem ⋮ Shellsort with a constant number of increments ⋮ On shellsort and the Frobenius problem

Cites Work

• Unnamed Item
• Unnamed Item
• Tight Bounds on the Complexity of Parallel Sorting
• A Linear Diophantine Problem
• A new upper bound for Shellsort
• Sorting in Average Time $o(\log \,n)$
• On the linear diophantine problem of Frobenius.

This page was built for publication: Improved upper bounds on Shellsort