算法问题(气泡插入和选择排序)打印输出

def bubble_sort(arr):
    n = len(arr)
    for i in range(n):
        for j in range(0, n-i-1):
            if arr[j] > arr[j+1]:
                arr[j], arr[j+1] = arr[j+1], arr[j]
    return arr

# 示例输出
arr = [64, 34, 25, 12, 22, 11, 90]
print("原始数组:", arr)
print("排序后数组:", bubble_sort(arr))

def selection_sort(arr):
    n = len(arr)
    for i in range(n):
        min_index = i
        for j in range(i+1, n):
            if arr[j] < arr[min_index]:
                min_index = j
        arr[i], arr[min_index] = arr[min_index], arr[i]
    return arr

# 示例输出
arr = [64, 34, 25, 12, 22, 11, 90]
print("原始数组:", arr)
print("排序后数组:", selection_sort(arr))