python 冒泡排序

Posted 2023-03-01 夏天然后

def bubbleSort(input_list):

	if len(input_list) == 0:
		return []
	sorted_list = input_list
	for i in range(len(sorted_list) - 1):
		print('第%d趟排序:' % (i + 1))
		for j in range(len(sorted_list) - 1):
			if sorted_list[j + 1] < sorted_list[j]:
				sorted_list[j], sorted_list[j + 1] = sorted_list[j + 1], sorted_list[j]
			print(sorted_list)
	return sorted_list

if __name__ == '__main__':
	input_list = [15, 12, 7, 9, 1, 3]
	print('排序前:', input_list)
	sorted_list = bubbleSort(input_list)
	print('排序后:', sorted_list)

排序前: [15, 12, 7, 9, 1, 3]
第1趟排序:
[12, 15, 7, 9, 1, 3]
[12, 7, 15, 9, 1, 3]
[12, 7, 9, 15, 1, 3]
[12, 7, 9, 1, 15, 3]
[12, 7, 9, 1, 3, 15]
第2趟排序:
[7, 12, 9, 1, 3, 15]
[7, 9, 12, 1, 3, 15]
[7, 9, 1, 12, 3, 15]
[7, 9, 1, 3, 12, 15]
[7, 9, 1, 3, 12, 15]
第3趟排序:
[7, 9, 1, 3, 12, 15]
[7, 1, 9, 3, 12, 15]
[7, 1, 3, 9, 12, 15]
[7, 1, 3, 9, 12, 15]
[7, 1, 3, 9, 12, 15]
第4趟排序:
[1, 7, 3, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
第5趟排序:
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
[1, 3, 7, 9, 12, 15]
排序后: [1, 3, 7, 9, 12, 15]