数据结构：冒泡排序(Python实现)

冒泡排序的原理不加以解释，很多别的网站都有

#稳定排序算法
def bubble_sort(shuzu):
    n=len(shuzu)
    for i in range(n-1):
        count=0
        for j in range(n-1-i):
            if shuzu[j]>shuzu[j+1]:
                shuzu[j],shuzu[j + 1]=shuzu[j+1],shuzu[j]
                count+=1
        if count==0:
            break
    return shuzu
import time


if __name__=='__main__':
    t1=time.time()
    a=[1,2,5,79,8,5,634,6,6,3,]
    print(bubble_sort(a))
    t2 = time.time()
    print(t2-t1)

测试结果