An improved shellsort algorithm

DOI10.1016/S0304-3975(97)00100-XMaRDI QIDQ1389663zbMATH OpenOpenAlexFDO

Authors Renren Liu

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00100-x

zbMATH Keywords

AlgorithmSorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Improved upper bounds on Shellsort
• scientific article; zbMATH DE number 1256658
• A new upper bound for Shellsort
• Analysis of Shellsort and related algorithms
• Randomized shellsort: a simple data-oblivious sorting algorithm
• Randomized Shellsort, a simple oblivious sorting algorithm
• Tight lower bounds for Shellsort
• scientific article; zbMATH DE number 4062611
• scientific article; zbMATH DE number 4115989

Cited in

(1)

• INSERTION SORT is O(n n)

This page was built for publication: An improved shellsort algorithm

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