def bsortOne(l: list): for i in range(len(l) - 1): if (l[i] >= l[i + 1]): temp = l[i] l[i] = l[i + 1] l[i + 1] = temp return l def bsortAll(l: list): i = 0 while i < (len(l) - 1): bsortOne(l) i = i + 1 return l l = [9, 88, 2, 1, 4, 1] print(bsortAll(l))
原文:https://www.cnblogs.com/hd92/p/14983753.html