期刊文献+

希尔排序效率的真实性拟合尝试——Sedgewick增量序列(1982)

Attempt at Credible Empirical Study of Shellsort——Sedgewick's Increment Sequence in 1982
下载PDF
导出
摘要 为了对复杂性未知的希尔排序算法进行合理、可信的数值估计,提出拟合不变性结合拟合准确性和显著性的拟合思想和方法,并对采用Sedgewick增量序列4倡22i+3倡2i+1的希尔排序算法的平均比较次数进行了数值估计,从cnαlnβ( n)形式开始,在规模为104~108的测试数据的不同区段分别拟合,根据拟合参数的变动特点,进行合理推断并再次拟合及验证,从而逐步分离和确定出α=1, c=1,β=1.41,最终获得了对各区段拟合几乎不变的结果nln1.41( n).拟合方法本身的正确性用已知结果的排序数据进行了验证. In order to estimate unknown complexity of Shellsort reasonably and credibly ,this paper sug-gested combination of fitting invariability with fitting precision and significance , and accordingly the average number of comparisons of Shellsort with Sedgewick′s increment sequence 4*22i+3*2i+1 was ob-tained about to nln1.41(n),which was originated from cnαlnβ(n),with parameter inferring from its appear-ance in different data segments among size of 104 to 108 ,refitting and validating , the values of α=1,c=1,β=1.41 were determined progressively .The correctness of the fitting method proposed was verified by data with known complexity .
作者 胡圣荣
出处 《湖北民族学院学报(自然科学版)》 CAS 2014年第2期218-221,共4页 Journal of Hubei Minzu University(Natural Science Edition)
关键词 排序 希尔排序 算法 拟合 拟合不变性 sort shellsort algorithm fit fitting invariability
  • 相关文献

参考文献9

  • 1Shell D L.A high-speed sorting procedure[ J].Communications of the ACM,1959,2(7):30-32.
  • 2Sedgewick R.Analysis of Shellsort and Related Algorithms [ J ].European Symposium on Algorithms,1996:1-11.
  • 3Jiang T,Li M,vitrnyi P.A lower bound on the average-case complexity of Shellsort [ J ].JACM,2000,47(5):905-911.
  • 4Sanders P,Fleischer R.Asymptotic complexity from experiments? A case study for randomized algorithms [C]//Algorithm Engineering,Springer-Berlin Heidelberg.2001:135-146.
  • 5Weiss M A.Short Note Empirical study of the expected running time of Shell sort [ J ].The Computer Journal,1991,34(1):88-91.
  • 6Cotta C,Moscato P.A mixed evolutionary-statistical analysis of an algorithm's complexity [ J ].Applied Mathematics Letters,2003,16(1):41-47.
  • 7Ciura M.Best increments for the average case of shellsort[J].Lecture notes in computer science,2001:106-117.
  • 8胡圣荣.关于排序效率的数值估计[J].广州城市职业学院学报,2008,2(1):61-64. 被引量:4
  • 9胡圣荣.关于排序算法的随机输入序列[J].武汉理工大学学报,2006,28(9):105-107. 被引量:6

二级参考文献6

  • 1胡圣荣.关于排序算法的随机输入序列[J].武汉理工大学学报,2006,28(9):105-107. 被引量:6
  • 2Knuth D E.计算机程序设计艺术(第3卷排序与查找)[M].第2版.苏运霖,译.北京:国防工业出版社,2002.
  • 3Sanders P, Fleischer R. Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms[J]. Lecture Notes in Computer Science, 2001,1982 : 135-146.
  • 4Weiss M A. Empirical Study of the Expected Running Time of Shellsort[J]. The Computer Journal, 1991,34 (1) :88-91.
  • 5Mark Allen Weiss.数据结构与问题求解(Java版)[M].第2版.陈明,译.北京:电子工业出版社,2003.
  • 6Bentley J. Programming Pearls[J]. Communications of the ACM, 1987,30 (9) : 754-757.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部