Python选择排序算法(二)

接上篇选择排序算法,使用不同的思路展示,第一次尝试用的是记录最小值,变换位置,本次尝试用的是记录最小值的位置,转换值

Python代码如下

#! coding:utf8

import random

def select_sort(arr):
    for i in range(len(arr) - 1):
        min_position = i
        for j in range(i + 1, len(arr)):
            min_position = j if arr[min_position] > arr[j] else min_position
        swap_pos(arr, i, min_position)
        print("循环结果:", arr)


def swap_pos(arr, i, j):
    temp = arr[i]
    arr[i] = arr[j]
    arr[j] = temp


if __name__ == '__main__':
    arr_list = [each for each in range(10)]
    random.shuffle(arr_list)
    print("原始列表:", arr_list)
    select_sort(arr_list)

结果展示:

原始列表: [6, 0, 8, 7, 5, 9, 2, 1, 4, 3]
循环结果: [0, 6, 8, 7, 5, 9, 2, 1, 4, 3]
循环结果: [0, 1, 8, 7, 5, 9, 2, 6, 4, 3]
循环结果: [0, 1, 2, 7, 5, 9, 8, 6, 4, 3]
循环结果: [0, 1, 2, 3, 5, 9, 8, 6, 4, 7]
循环结果: [0, 1, 2, 3, 4, 9, 8, 6, 5, 7]
循环结果: [0, 1, 2, 3, 4, 5, 8, 6, 9, 7]
循环结果: [0, 1, 2, 3, 4, 5, 6, 8, 9, 7]
循环结果: [0, 1, 2, 3, 4, 5, 6, 7, 9, 8]
循环结果: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]