Shell sort with expected complexity of O(nlog2n)

被引：0
|
作者：
Hu, Shengrong [1 ]
机构：
[1] South China Agr Univ, Coll Water Conservancy & Civil Engn, Guangzhou 510642, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2025年 / 1034卷
关键词：
Sorting; Shell sort; Algorithm; Fitting; Stability fitting;
D O I：
10.1016/j.tcs.2025.115122
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Theoretical analysis of the Shell sort algorithm has been a longstanding challenge, and there have been no reports of a Shell sort algorithm with a complexity of O(nlog2n). This study investigated the efficiency of the Shell sort algorithm using a specific increment sequence and conducted stability fitting. The fitting results strongly suggest that the number of key comparisons and movements follows the form cnln(n)+dn(lambda)ln(n), where lambda<1, implying an overall complexity of O (nlog(2)n).
引用
收藏
页数：12
相关论文
共 50 条
12345