a = [3,0,1,8,7,2,5,4,6,9]
#a = [9,8,7,6,5,4,3,2,1,0]
n = 10
'''
#重複n-1回合,第 j 回合將a[n-1-j]數字的定位,定位方法如下
for j in range(n-1):
#重複執行 n-1-j 次,第 i 回合比較a[i]與a[i+1]大小,若反序則互換
for i in range(n-1-j):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
#no_change = i+1
print(a)
## 我喜歡的泡沫排序:第j回合將a[j]歸位
for j in range(n-1):
for i in range(n-1, j, -1):
if a[i] < a[i-1]:
a[i], a[i-1] = a[i-1], a[i]
print(a)
'''
# 影片的bubble-sort實作
end = n
while end > 0:
c = 0
for i in range(0, end-1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
c = i+1
end = c
print(end, a)
or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up