python选择排序算法的特点

def swap(nums, idx1, idx2):

    if idx1 == idx2:

        return

    temp = nums[idx1]

    nums[idx1] = nums[idx2]

    nums[idx2] = temp

def select_sort(nums):

    """

    选择排序，记录最小元素的索引，最后才交换位置

    :param nums:

    :return:

    """

    l = len(nums)

    for i in range(l):

        min_index = i

        for j in range(i + 1, l):

            if nums[j] < nums[min_index]:

                min_index = j

        swap(nums, i, min_index)