冒泡排序算法

第一种

import time
import random
# sata=[i-random.randint(1,4000) for i in range(1,10000)]
sata=[2,4,5,3,9,4,87,56,76]
newdata=[]
#a=time.perf_counter()
while len(sata)>0:
    one=min(sata)
    ind=sata.index(one)
    sata.pop(ind)
    newdata.append(one)
#b=time.perf_counter()
print(newdata)
# print(b-a)

第二种

import time
import random

ones=[11,10,5,3,9,4,87,56,76]
# ones=[i-random.randint(1,4000) for i in range(1,10000)]
# aa=time.perf_counter()
for i in range(len(ones)):
    for j in range(0,len(ones)-i-1):
        if ones[j]>ones[j+1]:
            ones[j],ones[j+1]=ones[j+1],ones[j]
# bb=time.perf_counter()

print(ones)