Python排序算法动态图形化演示(实现代码)

 1 # 冒泡排序
 2 def bubbleSort(li):
 3     n = len(li)
 4     for i in range(n-1):
 5         for j in range(n-i-1):
 6             if li[j] > li[j+1]:
 7                 li[j],li[j+1] = li[j+1],li[j]
 8 
 9 if __name__ == ‘__main__‘:
10     li = [3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
11     bubbleSort(li)
12     print(li)

 1 # 选择排序
 2 def selectSort(li):
 3     n = len(li)
 4     for i in range(n):
 5         temp = i
 6         for j in range(temp,n):
 7             if li[temp] > li[j]:
 8                 li[temp],li[j] = li[j],li[temp]
 9 
10 if __name__ == ‘__main__‘:
11     li = [3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
12     selectSort(li)
13     print(li)

 1 # 快速排序
 2 def quickSort(li):
 3     if li:
 4         mark=li[0]
 5         little=[m for m in li if m<mark]
 6         big=[x for x in li if x>mark]
 7         return quickSort(little)+[mark]+quickSort(big)
 8     else:
 9         return []
10 if __name__==‘__main__‘:
11     li = [3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
12     print(quickSort(li))

 1 # 插入排序
 2 def insertSort(li):
 3     length = len(li)
 4     for i in range(1,length):
 5         x = li[i]
 6         for j in range(i,-1,-1):
 7             # j为当前位置，试探j-1位置
 8             if x < li[j-1]:
 9                 li[j] = li[j-1]
10             else:
11                 # 位置确定为j
12                 break
13         li[j] = x
14 
15 if __name__ == ‘__main__‘:
16     li = [3,44,38,5,47,15,36,26,27,2,46,4,19,50,48]
17     insertSort(li)
18     print(li)