arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.00316cs.DS
收藏

Shellsort的优化观点

Optimization Perspectives on Shellsort

Oscar Skean, Richard Ehrenborg, Jerzy W. Jaromczyk

摘要:

Shellsort是一种排序方法,由于其简单而具有吸引力,但需要努力分析其效率。该算法的核心是在排序过程中先验选择并使用的间隙序列。该空位序列的选择影响Shellsort的效率,从而驱动其理论和实验分析。我们通过识别基于新参数化函数的高效空位序列来为Shellsort做出贡献。具体而言,一个参数网格搜索识别不同的输入大小排序的最佳参数,通过观察最小的开销在三个类别:数量的比较,数量的交流,和运行时间。我们报告说,我们的方法发现,序列优于国家的最先进的差距序列的比较选择的小数组大小的数量。此外,我们的基于函数的序列优于德田序列的运行时间为选定的大数组大小。然而,在尽量减少交换次数时,没有观察到实质性的改善。

英文摘要:

Shellsort is a sorting method that is attractive due to its simplicity, yet it takes effort to analyze its efficiency. The heart of the algorithm is the gap sequence chosen a priori and used during sorting. The selection of this gap sequence affects the efficiency of Shellsort, and thus drives both its theoretical and experimental analysis. We contribute to Shellsort by identifying efficient gap sequences based on new parameterized functions. Specifically, a parameter grid-search identifies optimal parameters for different input sizes for sorting by observing minimal overhead in three categories: number of comparisons, number of exchanges, and running time. We report that our method finds sequences that outperform state-of-the-art gap sequences concerning the number of comparisons for chosen small array sizes. Additionally, our function-based sequences outperform the running time of the Tokuda sequence for chosen large array sizes. However, no substantial improvements were observed when minimizing the number of exchanges.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑