def merge_sort(arr):
if len(arr) <= 1:
return arr
mid = len(arr) // 2 # 找到中间索引
left = merge_sort(arr[:mid]) # 排序左半部分
right = merge_sort(arr[mid:]) # 排序右半部分
return merge(left, right)
def merge(left, right):
result = []
i = j = 0
while i < len(left) and j < len(right):
if left[i] < right[j]:
result.append(left[i])
i += 1
else:
result.append(right[j])
j += 1
result.extend(left[i:])
result.extend(right[j:])
return result
# 示例
arr = [38, 27, 43, 3, 9, 82, 10]
sorted_arr = merge_sort(arr)
print("排序后的数组:", sorted_arr)
def fibonacci(n, memo={}):
if n in memo: # 记忆化
return memo[n]
if n <= 1:
return n
memo[n] = fibonacci(n-1, memo) + fibonacci(n-2, memo)
return memo[n]
# 示例
print("第10个斐波那契数:", fibonacci(10))
暂无评论