The Worst Case in Shellsort and Related Algorithms

DOI10.1006/JAGM.1993.1032MaRDI QIDQ3141524zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bjorn Poonen

Publication date 6 December 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1993.1032

zbMATH Keywords

sortingupper bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4126701
• Lower Bounds for Shellsort
• On the average-case complexity of Shellsort
• Shellsort with a constant number of increments
• A new upper bound for Shellsort

Cited in

(9)

• Bad cases for shaker-sort
• Analyzing variants of Shellsort
• Shellsort with a constant number of increments
• On shellsort and the Frobenius problem
• Tight lower bounds for Shellsort
• A Lower Bound on the Size of Shellsort Sorting Networks
• scientific article; zbMATH DE number 4126701 (Why is no real title available?)
• Lower Bounds for Shellsort
• Analysis of Shellsort and related algorithms

This page was built for publication: The Worst Case in Shellsort and Related Algorithms

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