- 时间复杂度O(n2)
- 稳定排序
def bubble_sort(arr):
n = len(arr)
for i in range(n):
for j in range(n-1, i, -1):
if arr[j] < arr[j-1]:
arr[j-1], arr[j] = arr[j], arr[j-1]
def bubble_sort(arr):
n = len(arr)
for i in range(n):
for j in range(n-1, i, -1):
if arr[j] < arr[j-1]:
arr[j-1], arr[j] = arr[j], arr[j-1]