Shellsort with a constant number of increments

DOI10.1007/BF01944355zbMath0860.68036OpenAlexW2063540827MaRDI QIDQ1816996

Yanyan Li

Publication date: 1 December 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01944355

zbMATH Keywords

sortingShellsort

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• More on shellsort increment sequences
• Improved upper bounds on Shellsort
• The Worst Case in Shellsort and Related Algorithms
• Tight lower bounds for Shellsort
• A new upper bound for Shellsort
• On the linear diophantine problem of Frobenius.
• On a Problem of Partitions

This page was built for publication: Shellsort with a constant number of increments