def BubbleSort(nums):
n = len(nums)
for i in range(n-1, 0, -1):
finish = True
for j in range(1, i+1):
if nums[j]<nums[j-1]:
temp = nums[j]
nums[j] = nums[j-1]
nums[j-1] = temp
finish = False
if finish==True:
return
if __name__ == '__main__':
nums = [int(i) for i in raw_input().split()]
BubbleSort(nums)
print nums
冒泡排序 Python实现
最新推荐文章于 2023-04-02 20:29:24 发布