冒泡排序python实现

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