【算法】冒泡排序

1. python实现

参考：https://blog.csdn.net/wangzhiping321/article/details/82381704

"""
冒泡排序，算法复杂度O(n^2)
"""
import numpy as np
def bubblesort(data):
    count=0
    for i in range (0, len(data)):
        for j in range (i+1, len(data)):
            if data[i]>data[j]: #如果前一个数大于后面一个数，则调换两个数的位置
                temp = data[i]
                data[i] = data[j]
                data[j] = temp
                count+=1
    print(count) #共计算12次
    return data                    
nums = [3,5,7,8,20,9,4,6,10,27,46,30]
print(nums)
print(bubblesort(nums)) 
#########################################################
[3, 5, 7, 8, 20, 9, 4, 6, 10, 27, 46, 30]
12
[3, 4, 5, 6, 7, 8, 9, 10, 20, 27, 30, 46]


#该程序还有另一种写法，结果和上面的相同
def bubblesort(data):
    count=0
    for i in range(len(data)-1): #共循环len(data)轮，从0开始计数，range范围是左闭右开
        for j in range(len(data)-1-i):
            if data[j]>data[j+1]:
                data[j], data[j+1] = data[j+1], data[j]
                count+=1
    print(count)
    return data