冒泡算法:将需要排序的元素看作是一个个“气泡”,最小的“气泡”最先浮出水面,排在最前面。从小到大依次排列。
代码如下:
# Filename:bubbleSort
def bubbleSort(numbers):
for j in xrange(len(numbers)-1, -1, -1):
for i in xrange(j):
if numbers[i] > numbers[i+1]:
numbers[i], numbers[i+1] = numbers[i+1], numbers[i] # 交换数据
print numbers
def main():
numbers = [23, 12, 9, 15, 6]
bubbleSort(numbers)
if __name__ == '__main__':
main()