猫史档案馆


Python反向冒泡排序

用户:SkyWolfSkyWolf查看:0 回复:1 评论:0 创建时间:2019-09-29T21:16:14


请大神帮忙解答一道难题!!!

反向冒泡排序要求:插入十个20以内的随机数,并利用冒泡排序算法将它们由大到小地排列出来,并且输出到终端。

代码如下:

import random
import time

j = 0
i = 0
temp = 0
numbers = []
for x in range(10):
    numbers.append(random.randint(1, 20))

def MaoPaoPaiXu(Numbers):
    Y = False
    for i in range(len(numbers)):
        Y = True
        for j in range(len(numbers) - i - 1):
            if (numbers[j] < numbers[j + 1]):
                temp = numbers[j]
                numbers[j] = numbers[j + 1]
                numbers[j + 1] = temp
        if Y:
            break

start = time.time()
MaoPaoPaiXu(numbers)
useTime = time.time() - start
print('用了' + str(useTime) + '秒')
print(numbers)

start = time.time()
MaoPaoPaiXu(numbers)
useTime = time.time() - start
print('用了' + str(useTime) + '秒')
print(numbers)

请打神帮忙解答,我这是出了神马BUG,谢谢谢谢谢!!!

(工具:Visual Studio Code)


回复

上一页1 页 / 共 1下一页
银天X银天X

还有反向冒泡排序???我太无知了...

点赞0


评论