冒泡排序函数代码详解
def bubble_sort(arr):
n=len(arr)
for i in range(n):
already_sorted = True
for j in range(0,n-i-1):
if arr[j] > arr[j + 1]:
arr[j], arr[j + 1] = arr[j + 1],arr[j]
already_sorted = False
if already_sorted:
break
return arr
arr = [64,34,25,12,22,11,90]
sort_arr = bubble_sort(arr)
print("Sorted array is:",sort_arr)
完整代码
def bubble_sort(arr):
n=len(arr)
for i in range(n):
already_sorted = True
for j in range(0,n-i-1):
if arr[j] > arr[j + 1]:
arr[j], arr[j + 1] = arr[j + 1],arr[j]
already_sorted = False
if already_sorted:
break
return arr
arr = [64,34,25,12,22,11,90]
sort_arr = bubble_sort(arr)
print("Sorted array is:",sort_arr)