python3 冒泡、选择、插入排序算法

最新推荐文章于 2023-08-01 16:30:55 发布

LOST_9

最新推荐文章于 2023-08-01 16:30:55 发布

阅读量260

点赞数 1

分类专栏： python3

本文链接：https://blog.csdn.net/u013091109/article/details/80737300

版权

python3 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

nums=[0,81,71,62,53,44,2,343.234,234,12,5,6,74,0,81,71,62,53,44,2,343.234,234,12,5,6,74]
def bubbleSort(nums):
    #两两比较
    for i in range(len(nums)-1):
        for j in range(len(nums)-1-i):
            if nums[j]>nums[j+1]:
                nums[j],nums[j+1]=nums[j+1],nums[j]
    return nums
def selectSort(nums):
    #找到最小值
    for i in range(len(nums)-1):
        smalllest = i
        for j in range(i+1,len(nums)-1):
            if nums[j]<nums[smalllest]:
                nums[j], nums[smalllest] = nums[smalllest], nums[j]
    return nums
def insertSort(nums):
    for i in range(1,len(nums)):
        temp = nums[i]
        for j in range(i,-1,-1):
            # j为当前位置，试探j-1位置
            if temp < nums[j-1]:
                nums[j] = nums[j-1]
            else:
                # 位置确定为j
                break
        nums[j] = temp
    return nums
print(insertSort(nums))
print(bubbleSort(nums))
print(selectSort(nums))