冒泡排序

 l = [2,5,12,352,1,23,35,63,5,2] # 0-9
 for i in range(len(l)-1): #这个是控制总共需要多少趟
     for j in range(len(l)-1-i): #这个循环是控制交换的 9
         if l[j] > l[j+1]:
             l[j],l[j+1] = l[j+1],l[j]

d = {‘行者无疆‘: 246, ‘王三侠‘: 210, ‘大亮‘: 128, ‘毛多锁‘: 418, ‘追~落日‘: 3.21, ‘小文‘: 416, ‘瑞峰‘: 22.13, ‘尤文奎Alex‘: 138, ‘阿梁‘: 167, ‘山峰‘: 0, ‘David‘: 350, ‘胖胖球??‘: 68.16, ‘幸福哥‘: 100, ‘梁明‘: 350, ‘郝明明‘: 64, ‘赵宗来‘: 136.32, ‘平民之女‘: 9.66, ‘王俊兵‘: 65, ‘祁棒棒‘: 79.24, ‘陈陈‘: 20, ‘兔兔‘: 49, ‘小了白了兔‘: 55, ‘高娃‘: 100.7, ‘漠然‘: 139, ‘心语‘: 216, ‘王成‘: 183, ‘陈卫亮‘: 141.75}

data = list(d.items())
# print(data)
for i in range(len(data)-1): #这个是控制总共需要多少趟
    for j in range(len(data)-1-i): #这个循环是控制交换的 9
        if data[j][-1] < data[j+1][-1]:
            data[j],data[j+1] = data[j+1],data[j]
count = 1
for name,km in data:
    print(‘%s. %s %s‘%(count,name,km))
    count+=1