希尔排序理想最优增量序列的研究

Research on the ideal optimal increment sequence of Shellsort

希尔排序的运行效率取决于对增量序列的选择。随着新增量序列的提出,希尔排序的执行效率不断提高,然而始终未能求得理想最优增量序列。文章总结增量序列的更新历程,研究希尔排序算法及其各种增量序列,探究理想最优序列。提出一种新的增量序列——Li序列,并给出Li序列的实现过程和具体推导过程。Li序列有待进一步完善,但通过实验,多维度比较Li序列与当前主流增量序列的优劣,证明Li序列是最接近理想最优增量序列的增量序列之一。

The operating efficiency of Shellsort depends on the choice of incremental sequence.With the introduction of new incremental sequences,the execution efficiency of Shellsort has been continuously improved,but the ideal optimal incremental sequence has not been obtained.This paper summarizes the update process of the incremental sequence,studies Shellsort algorithm and its various incremental sequence,and explores the ideal optimal sequence.This paper proposes a new incremental sequence:Li sequence,and gives the realization process and specific derivation process of Li sequence.The Li sequence needs to be further improved,but comparing the advantages and disadvantages of the Li sequence and the current mainstream incremental sequence through experiments in multiple dimensions it is proved that the Li sequence is one of the incremental sequences closest to the ideal optimal incremental sequence.