Day_06_PM_Sorting_Algorithm
'''
原理:
[9, 7, 6, 8, 5, 4, 3, 2, 1]
第一次(i = 0, j = 9 - i - 1) [9, 7, 6, 8, 5, 4, 3, 2, 1] => [7, 6, 8, 5, 4, 3, 2, 1, 9]
第二次(i = 1, j = 9 - i - 1) [7, 6, 8, 5, 4, 3, 2, 1, 9] => [6, 7, 5, 4, 3, 2, 1, 8, 9]
第三次(i = 2, j = 9 - i - 1) [6, 7, 5, 4, 3, 2, 1, 8, 9] => [6, 5, 4, 3, 2, 1, 7, 8, 9]
第四次(i = 3, j = 9 - i - 1) [6, 5, 4, 3, 2, 1, 7, 8, 9] => [5, 4, 3, 2, 1, 6, 7, 8, 9]
第五次(i = 4, j = 9 - i - 1) [5, 4, 3, 2, 1, 6, 7, 8, 9] => [4, 3, 2, 1, 5, 6, 7, 8, 9]
第六次(i = 5, j = 9 - i - 1) [4, 3, 2, 1, 5, 6, 7, 8, 9] => [3, 2, 1, 4, 5, 6, 7, 8, 9]
第七次(i = 6, j = 9 - i - 1)...
第八次(i = 7, j = 9 - i - 1)...
'''
nums = [9, 7, 6, 8, 5, 4, 3, 2, 1]
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]
print(nums)
'''
原理:
[9, 7, 6, 8, 5, 4, 3, 2, 1]
第一次(i=0) [9, 7, 6, 8, 5, 4, 3, 2, 1] => [1, 7, 6, 8, 5, 4, 3, 2, 9]
第一次(i=1) [1, 7, 6, 8, 5, 4, 3, 2, 9] => [1, 2, 6, 8, 5, 4, 3, 7, 9]
以此类推...
'''
nums = [9, 7, 6, 8, 5, 4, 3, 2, 1]
for i in range(len(nums) - 1):
min_index = i
for j in range(i, len(nums)):
if nums[j] < nums[min_index]:
min_index = j
nums[i], nums[min_index] = nums[min_index], nums[i]
print(nums)