冒泡排序:
def bubbleSort(L):
size = len(L)
for i in range(0,size):
for j in range(0,size-i-1):
if(L[j]>L[j+1]):
L[j], L[j + 1] = L[j + 1], L[j]
return L
print bubbleSort(L)
冒泡排序:
def bubbleSort(L):
size = len(L)
for i in range(0,size):
for j in range(0,size-i-1):
if(L[j]>L[j+1]):
L[j], L[j + 1] = L[j + 1], L[j]
return L
print bubbleSort(L)