IDE验证:
def insertsort(ary):
n = len(ary)
for i in range(1,n):
j = i - 1
while j >= 0:
if ary[j] > ary[j+1]:
ary[j], ary[j+1] = ary[j+1], ary[j]
j -= 1
return ary
def bubblesort(ary):
n = len(ary)
for i in range(n-1):
for j in range(n-1-i):
if ary[j] > ary[j+1]:
ary[j], ary[j+1] = ary[j+1], ary[j]
return ary
if __name__ == "__main__":
ary = [12, 15, 9, 20, 6, 31, 24]
#insertsort(ary)
bubblesort(ary)
print(ary)