python写的冒泡排序

来源:互联网 发布:apache https 编辑:程序博客网 时间:2024/06/05 04:39

python脚本语言确实简直易懂,非常有趣

直接上代码:

1)

print("Pop algorithm...")

def sortt(lst):
    num = len(lst)
    for i in range(0, num, 1):
        for j in range(i, num, 1):
            if lst[i] > lst[j]:
                lst[i] = lst[i] - lst[j] #差值
                lst[j] = lst[j] + lst[i]
                lst[i] = lst[j] - lst[i]


list = [4,3,7,0,2]
sortt(list)
print(list)

 

2)

 

def bubblesort(numbers):
    forjin range(len(numbers)-1,-1,-1):
        for i inrange(j):
            if numbers[i]>numbers[i+1]:
               numbers[i],numbers[i+1]=numbers[i+1],numbers[i]
            print(i,j)
            print(numbers)

测试代码及输出:

>>> numbers = [1,3,82,77,52,2,100,90]
>>> bubblesort(numbers)