‘‘‘
    選擇排序:選擇最小的,以此類推
‘‘‘
import random
import cProfile
def select_Sort(nums):
    for i in range(len(nums)-1):
        for j in range(i+1,len(nums)):
            if nums[i] > nums[j]:
                # max =  nums[i]
                # nums[i] = nums[j]
                # nums[j] = max
                #python有更好的寫法
                nums[i],nums[j] = nums[j],nums[i]
    return nums





nums = [random.randint(0,10000) for i in range(10000)]
print(select_Sort(nums))
cProfile.run(‘select_Sort(nums)‘)

　　運行結果:

排序:略

運行時間:3.339秒(稍微低於冒泡排序)

<每日一題>題目26：選擇排序(冒泡排序改進版)