A new upper bound for Shellsort
From MaRDI portal
Recommendations
Cited in
(22)- Improved upper bounds on Shellsort
- Bad cases for shaker-sort
- Lattice translates of a polytope and the Frobenius problem
- An improved shellsort algorithm
- Shellsort with a constant number of increments
- On shellsort and the Frobenius problem
- Shellsort with three increments
- The Worst Case in Shellsort and Related Algorithms
- Asymptotic analysis of (3, 2, 1)-shell sort
- Tight lower bounds for Shellsort
- The Frobenius Problem and Its Generalizations
- A Lower Bound on the Size of Shellsort Sorting Networks
- scientific article; zbMATH DE number 4126701 (Why is no real title available?)
- scientific article; zbMATH DE number 1256658 (Why is no real title available?)
- On the average-case complexity of Shellsort
- Analysis of Shellsort and related algorithms
- scientific article; zbMATH DE number 4115989 (Why is no real title available?)
- scientific article; zbMATH DE number 1839436 (Why is no real title available?)
- Stochastic analysis of Shell Sort
- Order statistics in large arrays (OSILA): a simple randomised algorithm for a fast and efficient attainment of the order statistics in very large arrays
- Efficient sorting during repetitive statistical computations: Algorithms and an application
- More on shellsort increment sequences
This page was built for publication: A new upper bound for Shellsort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742727)