python實現插入和氣泡排序
阿新 • • 發佈:2019-01-03
開始學習python,看到函式一章,練習之餘,寫了兩個排序小函式
def select_sort(n):
for i in range(len(n)):
for j in range(len(n) -1):
if n[j] > n[j + 1]:
swap(n, j, j + 1)
def swap(n, i, j):
t = n[i]
n[i] = n[j]
n[j] = t
def insert_select(n):
for i in range(len(n)):
min_index = i
for j in range(i + 1, len(n)):
if n[min_index] < n[j]:
min_index = j
swap(n, i, min_index)
if __name__ == '__main__':
num = [2,1,6,23,15,8,9,100]
#select_sort(num)
insert_select(num)
for i in range(len(num)):
print(num[i])