Shell sorting algorithm: review and implementation example using Rcpp

This review resumes the most famous sorting algorithm: the shell Sort. This method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared.We used Rcpp to impliment the code in R and we show how the running time of Shell sort is heavily dependent on the gap sequence it use.

本综述回顾了最知名的排序算法：希尔排序（Shell Sort）。该算法首先对间距较大的元素对进行排序，随后逐步缩小待比较元素之间的间隔。我们采用Rcpp在R语言中实现了该算法的代码，并展示了希尔排序的运行时间在很大程度上依赖于其所使用的间隔序列。