Python实现选择排序和冒泡排序

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/weixin_43849107/article/details/102770564

选择排序

def SelectSort(arr):
    for i in range(len(arr) - 1):
        min_index = i
        for j in range(i + 1, len(arr)):
            if arr[j] < arr[min_index]:
                min_index = j
        arr[min_index], arr[j] = arr[j], arr[min_index]
    return arr


if __name__ == '__main__':
    print("请输入数组，整数与整数之间用空格隔开")
    arr = [int(n) for n in input().split()]
    SelectSort(arr)
    print("从小到大排序：", end="")
    print(arr)

冒泡排序

def BubbleSort(arr):
    exchange = len(arr) - 1
    while (exchange != 0):
        bound = exchange
        exchange = 0
        for j in range(bound):
            if (arr[j] > arr[j + 1]):
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                exchange = j
    return arr


if __name__ == '__main__':
    print("请输入数组，整数与整数之间用空格隔开")
    arr = [int(n) for n in input().split()]
    BubbleSort(arr)
    print("从小到大排序：", end="")
    print(arr)