# 冒泡排序for # for i in range(len(nums)-1): # for j in range(len(nums)-i-1): # if nums[j] > nums[j+1]: # nums[j],nums[j+1] = nums[j+1],nums[j] # print(nums) # 冒泡排序while # i = 0 # while i < len(nums)-1: # j = 0 # while j < len(nums)-i-1: # if nums[j] > nums[j + 1]: # nums[j],nums[j + 1]= nums[j+1],nums[j] # j+=1 # i+=1 # print(nums) # 快速排序法 # def KuaiSuPaiXu(nums:list)->list: # if len(nums) > 1: # lift = [] # right = [] # mid = nums[0] # for i in range(1,len(nums)): # if nums[i] <= mid: # lift.append(nums[i]) # else: # right.append(nums[i]) # return KuaiSuPaiXu(lift) + [mid] + KuaiSuPaiXu(right) # else: # return nums #插入排序 # def ChaRupaixu(nums:list)->list: # for i in range(1,len(nums)): # k = i # j = i - 1 # while nums[k] < nums[j] and j >= 0: # nums[k], nums[j] = nums[j], nums[k] # k -= 1 # j -= 1 # return nums
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请联系我们举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/221227.html原文链接：https://javaforall.net
