def shell_sort(arr):
n = len(arr)
gap = n // 2
while gap > 0:
for i in range(gap, n):
temp = arr[i]
j = i
while j >= gap and arr[j - gap] > temp:
arr[j] = arr[j - gap]
j -= gap
arr[j] = temp
gap //= 2
return arr
# 示例
arr = [52, 14, 64, 15, 3]
sorted_arr = shell_sort(arr)
print(sorted_arr)
Python实现希尔排序
最新推荐文章于 2024-07-21 22:27:18 发布