冒泡、选择、插入排序算法（python）

冒泡排序nums=[45,35,20,1110,45,4558,55,66,100]n=len(nums)foriinrange(n-1):forjinrange(n-i-1):ifnums[j]>nums[j+1]:nums[j+1],nums[j]=nums[j],nums[j+1]print(nums)输出结果为：[20,35,45,45,55,66,100,1110,4558]选择排序nums=[45,35,20,10,45,48,55,66,100]n=len(nums)foriinrange(n-1):forjinrange(i,n):如果nums[j]self.nums_list[j+1]:self.nums_list[j],self.nums_list[j+1]=self.nums_list[j+1],self.nums_list[j]print(self.nums_list)#选择顺序defxuanzei_sort(self):foriinrange(self.len_nums-1):forjinrange(i,self.len_nums):ifself.nums_list[j]