选择排序

最新推荐文章于 2024-03-22 17:14:14 发布

ThinkTimes

最新推荐文章于 2024-03-22 17:14:14 发布

阅读量105

点赞数

分类专栏：刷题总结

本文链接：https://blog.csdn.net/ThinkTimes/article/details/110368856

版权

刷题总结专栏收录该内容

6 篇文章 1 订阅

订阅专栏

# 选择最大的往后排，最后i个是有序列表
def selectMaxSort(aList):
    for i in range(len(aList)):
        maxNum = aList[0]
        maxLoc = 0
        for j in range(len(aList)-i):
            if aList[j] > maxNum:
                maxNum = aList[j]
                maxLoc = j
        aList[maxLoc], aList[len(aList)-1-i] = aList[len(aList)-1-i], aList[maxLoc]

# 选择最小的往前排，前i个是有序列表
def selectMinSort(aList):
    for i in range(len(aList)):
        minNum = aList[len(aList) - 1]
        minLoc = len(aList) - 1
        for j in range(i, len(aList)):
            if aList[j] < minNum:
                minNum = aList[j]
                minLoc = j
        aList[i], aList[minLoc] = aList[minLoc], aList[i]

alist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
selectMaxSort(alist)
print(alist)
blist = [54, 26, 93, 17, 77, 31, 44, 55, 20]
selectMinSort(blist)
print(blist)