冒泡排序
思路:外层循环指向每一个元素,内层循环进行没两个数交换
排序2
外层循环扫描每一个元素,内层循环,自己循环找到没个位置最小值或者最大值
代码
"""
@Time : 2024/4/21 19:06
@Author : chensong
@File : 排序2.py
@Desc :
"""
import time
# 在此处添加你的代码
list = [2,4,3,3,1,4,2];
turple = (1,4,5,6)
time0 = time.time_ns()
for i in range(0,len(list)):
for j in range(0,len(list)-1-i):
if list[j] < list[j+1]:
list[j],list[j+1] = list[j+1],list[j]
time3 = time.time_ns()
print("第一种方式排序时间:",time3-time0)
print(list)
time1 = time.time()
for i in range(0,len(list)):
for j in range(i,len(list)):
min = list[i]
while j <len(list) and list[j]<=list[i] :
min = list[j]
j = j+1
time2 = time.time()
print("第二种方式排序时间:",time2-time1)
print(list)