Improved upper bounds on Shellsort

DOI10.1016/0022-0000(85)90042-XzbMATH Open0583.68035OpenAlexW2035580504WikidataQ56113002 ScholiaQ56113002MaRDI QIDQ1069307FDOQ1069307

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A Linear Diophantine Problem
• On the linear diophantine problem of Frobenius.
• Tight Bounds on the Complexity of Parallel Sorting
• A new upper bound for Shellsort
• Sorting in Average Time $o(\log \,n)$

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069307)