冒泡排序算法(Python)

python学习网 2018-03-08 09:31:02
def Fun_Sort(lst):
    lens = len(lst) - 1
    for x in range(lens):
        for y in range(lens - x):
            if lst[y] > lst[y + 1]:
                lst[y], lst[y + 1] = \
                lst[y + 1], lst[y]
    return lst

l = [8,3,21,15,2,19,32,28,13]
print(Fun_Sort(l))
阅读(806) 评论(0)