测试一下python的冒泡

def bubble_sort(arr):
    n = len(arr)
    # 遍历所有数组元素
    for i in range(n):
        # Last i elements are already in place
        for j in range(0, n - i - 1):
            # 遍历数组从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(bubble_sort(arr))

print("排序后的数组:")
for i in range(len(arr)):
    print("%d" % arr[i], end=" ")