'''
冒泡排序:比较相邻元素,顺序错误就交换顺序
'''
import random
import cProfile
def bubble_Sort(nums):
for i in range(len(nums)-1):
for j in range(len(nums)-1-i):
if nums[j] > nums[j+1]:
nums[j],nums[j+1] = nums[j+1],nums[j]
return nums
nums = [random.randint(0,10000) for i in range(10000)]
print(bubble_Sort(nums))
cProfile.run('bubble_Sort(nums)')
运行结果:
排序结果:略
运行时间:5.041秒