閒來無事，用python練習一下排序算法，\(0^◇^0)/

# -*- coding=utf-8 -*-

import random


try:
	print("Bubble sorting...")

	sequence = []
	for i in range(0, 12):
		sequence.append(random.randint(0, 99))
	length = len(sequence)
	print("sequence length: {}".format(length))
	print("sequence befor sort: {}".format(sequence))

	for i in range(length):
		for j in range(length - i - 1):
			if sequence[j] > sequence[j + 1]:
				tmp = sequence[j]
				sequence[j] = sequence[j + 1]
				sequence[j + 1] = tmp
	print("sequence after sort: {}".format(sequence))

	print("\r\n")
	print("Insertion sorting...")
	del sequence

	sequence = []
	for i in range(0, 12):
		sequence.append(random.randint(0, 99))
	length = len(sequence)
	print("sequence length: {}".format(length))
	print("sequence befor sort: {}".format(sequence))

	for i in range(1, length):
		tmp = sequence[i]
		j = i
		while j>0 and sequence[j-1]>tmp:
			sequence[j] = sequence[j - 1]
			j -= 1
		sequence[j] = tmp
	print("sequence after sort: {}".format(sequence))


except Exception as e:
	print(e)