我Python你个算法问题（冒泡、斐波那契）

冒泡

data = [4,3,2,1]
count = 0
for j in range(1, len(data)):      #比较的趟数
    # count += 1
    for i in range(len(data)-j):      #每趟比较的次数
        count += 1
        if data[i] > data[i + 1]:      #两两比较，取出最小值
            tmp = data[i]
            data[i] = data[i + 1]
            data[i+1] = tmp
print(data)

斐波那契数列

a = 0
b = 1
while b < 100:
    print(b,end = ",")
    a,b = b,a+b