蓝桥杯 排序

最坏情况，全部逆序

i = 1
sum = 0
while(sum <= 100):
    sum += i
    i += 1
print(sum)
print(i)

105
15

所以有abcdefghijklmno这15个字母，将onmlkjihgfedcba减去5次移动，得到jonmlkihgfedcba，进而验证

Code

def bubble_sort_count(l):
    ct = 0
    for i in range(len(l)):
        for j in range(len(l) - i -1):
            if(ord(l[j]) > ord(l[j+1])):
                l[j], l[j+1] = l[j+1], l[j]
                ct += 1
    return ct
print(bubble_sort_count(list("jonmlkihgfedcba")))

100

Result

jonmlkihgfedcba