写一个Python冒泡排序的代码

def bubbleSort(arr):
n = len(arr)

# 遍历所有数组元素
for i in range(n):

# Last i elements are already in place
for j in range(0, n-i-1):

# 比较相邻的元素
if arr[j] > arr[j+1] :
arr[j], arr[j+1] = arr[j+1], arr[j]

# 测试算法
arr = [64, 34, 25, 12, 22, 11, 90]

bubbleSort(arr)

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