摘要
为了在排序算法复杂性的数据拟合和估计时,能从多种候选的拟合形式中更有理由地进行选择,而不是简单地以吻合良好来取舍,提出了拟合准确性和拟合不变性相结合的拟合观点,并以采用H ibbard序列和Knuth序列的希尔排序算法为例,进行了新的复杂性估计。
In order to choose a suitable fitting type more reasonably from several candidates in empirical complexity estimate of sort algorithms,and meanwhile eliminate a simple well-matched experiment data,a new fitting viewpoint is presented,which takes both fitting invariability and fitting precision into consideration. As an example,new complexity estimates of Shell sort with Hibbard＇s and Knuth＇s increment sequences are suggested.
出处
《广州城市职业学院学报》
2008年第1期61-64,共4页
Journal Of Guangzhou City Polytechnic
关键词
排序
希尔排序
算法
拟合
sort
Shell sort
algorithm
fitting
