"```python
lst = [i for i in range(20, 0, -1)]
length = len(lst)
r = length // 2
while r:
for i in range(length - r):
if lst[i] > lst[i + r]:
lst[i], lst[i + r] = lst[i + r], lst[i]
r = r // 2
els...
public class Method {//以下是希尔排序的两种实现方法 public void shellSort(int[] a) {//比较慢 /*//int[] a={5,9,4,2,1,10,7,8,3,6}，假如十个数; int temp=0; for (int i = 5; i <...
var shellSort = function(arr) {
var n = arr.length;
for (var gap = n / 2 | 0; gap > 0; gap = gap / 2 | 0) {
for (var groupIndex = 0; groupIndex < gap; groupIndex++) {
for (var c...
