def selection_sort(arr):
n = len(arr)
for i in range(n):
min_idx = i
# 找出未排序部分的最小元素的索引
for j in range(i+1, n):
if arr[j] < arr[min_idx]:
min_idx = j
# 将最小元素与当前位置交换
arr[i], arr[min_idx] = arr[min_idx], arr[i]
return arr
# 测试
arr = [64, 34, 25, 12, 22, 11, 90]
sorted_arr = selection_sort(arr)
print("排序后的数组:", sorted_arr)
插入排序和希尔排序
插入排序:
def insertion_sort(arr):
for i in range(1, len(arr)):
key = arr[i]
j = i - 1
while j >= 0 and key < arr[j]:
arr[j + 1] = arr[j]
j -= 1
arr[j + 1] = key
return arr
# 测试
arr = [64, 34, 25, 12, 22, 11, 90]
sorted_arr = insertion_sort(arr)
print("插入排序后的数组:", sorted_arr)
希尔排序:
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 = [64, 34, 25, 12, 22, 11, 90]
sorted_arr = shell_sort(arr)
print("希尔排序后的数组:", sorted_arr)