python冒泡排序

阅读更多
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]


def main():
	numbers = [12, 34, 3, 56, 399, 39, 28]
    bubbleSort(numbers)

if __name__ == '__main__':
	main()

你可能感兴趣的:(python冒泡排序)