Analyzing variants of Shellsort

DOI10.1016/S0020-0190(00)00223-4zbMath1032.68088DBLPjournals/ipl/Brejova01WikidataQ55885385 ScholiaQ55885385MaRDI QIDQ1603487

Broňa Brejová

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexityAnalysis of algorithmsSorting

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Average-case analysis of quicksort and binary insertion tree height using incompressibility ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons

Cites Work

• Unnamed Item
• Unnamed Item
• Bad cases for shaker-sort
• A lower bound on the average-case complexity of shellsort
• The Worst Case in Shellsort and Related Algorithms
• Analysis of Shellsort and related algorithms

This page was built for publication: Analyzing variants of Shellsort