壳排序的预期复杂度为 O(nlog2n)

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-02-11 DOI:10.1016/j.tcs.2025.115122

Shengrong Hu

{"title":"壳排序的预期复杂度为 O(nlog2n)","authors":"Shengrong Hu","doi":"10.1016/j.tcs.2025.115122","DOIUrl":null,"url":null,"abstract":"<div><div>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λln(n), where λ<1, implying an overall complexity of O(nlog2n).</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1034 ","pages":"Article 115122"},"PeriodicalIF":0.9000,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Shell sort with expected complexity of O(nlog2n)\",\"authors\":\"Shengrong Hu\",\"doi\":\"10.1016/j.tcs.2025.115122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>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λln(n), where λ<1, implying an overall complexity of O(nlog2n).</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1034 \",\"pages\":\"Article 115122\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-02-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S030439752500060X\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S030439752500060X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Shell sort with expected complexity of O(nlog2n)

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(nlog₂n). 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^λln(n), where λ<1, implying an overall complexity of O(nlog₂n).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.