1、冒泡排序 def bubbleSort(nums): for i in range(len(nums)-1): #只需进行length-1轮 for j in range(len(nums)-i-1): #后面i个已经排好序 if nums[j]>nums[j+1]: nums[j], nums[j+1] = nums[j+1], nums[j] return nums 2、选择排序 #这种写法每次if条件成立时都会进行一次交换 def selectSort1(nums): for i in range(len(nums)-1): for j in range(i+1, len(nums)): if nums[i]>nums[j]: nums[i], nums[j] = nums[j], nums[i] return nums #这种写法通过增加一个中间变量,使得每一轮(即对每一个i)只交换一次 def selectSort2(nums): for i in range(len(nums)-1): min_idx = i for j in range(i+1, len(nums)): if nums[j]<nums[min_idx]: min_idx = j nums[i], nums[min_idx] = nums[min_idx], nums[i] return nums 3、插入排序 #这种写法无需中间变量 def insertSort