Improved upper bounds on Shellsort

DOI10.1016/0022-0000(85)90042-XMaRDI QIDQ1069307zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• A new upper bound for Shellsort
• Tight lower bounds for Shellsort
• Shellsort with a constant number of increments
• scientific article; zbMATH DE number 1256658
• Lower Bounds for Shellsort

Cites work

• scientific article; zbMATH DE number 3841211 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A Linear Diophantine Problem
• A new upper bound for Shellsort
• On the linear diophantine problem of Frobenius.
• Sorting in Average Time $o(\log \,n)$
• Tight Bounds on the Complexity of Parallel Sorting

Cited in

(13)

• An improved shellsort algorithm
• Stochastic analysis of Shell Sort
• Shellsort with three increments
• Analysis of Shellsort and related algorithms
• A new upper bound for Shellsort
• Tight lower bounds for Shellsort
• 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 the average-case complexity of Shellsort
• 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)