Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting by exchange (bubble sort) or sorting by insertion (insertion sort).[3] The method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared. By starting with far apart elements, it can move some out-of-place elements into position faster than a simple nearest neighbor exchange. Donald Shell published the first version of this sort in 1959.[4][5] The running time of Shellsort is heavily dependent on the gap sequence it uses. For many practical variants, determining their time complexity remains an open problem. 【希尔排序（Shellsort），也称为希尔排序或希尔法，是一种就地比较排序。 它可以看作是交换排序（冒泡排序）或插入排序（插入排序）的推广。 [3] 该方法首先对彼此相距较远的元素对进行排序，然后逐渐减小要比较的元素之间的差距。 通过从相距较远的元素开始，它可以比简单的最近邻居交换更快地将一些不合适的元素移动到位。 Donald Shell 于 1959 年发布了此类的第一个版本。[4][5] Shellsort 的运行时间很大程度上取决于它使用的间隙序列。 对于许多实际变体，确定其时间复杂度仍然是一个悬而未决的问题。】