经典排序算法总结与实现(待补充)
2016-07-31 22:42:23 来源:慕课网
def bubbleSort(numbers): for j in range(0,len(numbers)): for i in range(0,len(numbers)): if numbers[j] < numbers[i]: numbers[j],numbers[i] = numbers[i],numbers[j] print(numbers)def main(): numbers = [23,12,6] bubbleSort(numbers)if __name__ == '__main__': main() 输出:
[3, 6, 1]
[6, 3, 1]
[6, 3, 1]
[3, 6, 1]
[3, 6, 1]
[3, 6, 1]
[1, 6, 3]
[1, 3, 6]
[1, 3, 6]
需要比较9次,才能得到结果