def merge_sort(arr): print("当前数组：", arr) if len(arr) <= 1: return arr mid = len(arr) // 2 left = merge_sort(arr[:mid]) right = merge_sort(arr[mid:]) merged = merge(left, right) print("合并后的数组：", merged) return merged def merge(left, right): merged = [] left_index, right_index = 0, 0 while left_index < len(left) and right_index < len(right): if left[left_index] < right[right_index]: merged.append(left[left_index]) left_index += 1 else: merged.append(right[right_index]) right_index += 1 merged.extend(left[left_index:]) merged.extend(right[right_index:]) return merged # 测试 merge_sort 函数 test_array = [6, 5, 4, 3, 2, 1] merge_sort(test_array)

38:55