冒泡排序
1 import random 2 3 4 def bubbling_sort(_list): 5 length_1 = len(_list)-1 6 for i in range(length_1): 7 is_exchange = False 8 for j in range(length_1-i): 9 if _list[j] > _list[j+1]: 10 _list[j], _list[j+1] = _list[j+1], _list[j] 11 is_exchange = True 12 if not is_exchange: 13 break 14 15 16 if __name__ == '__main__': 17 lis = [random.randint(0, 100) for i in range(100)] 18 print(lis) 19 bubbling_sort(lis) 20 print(lis)
冒泡排序是稳定排序

浙公网安备 33010602011771号