每日一题：快速排序

快速排序
原理：从序列中，任选一个记录k作为轴值pivot
将剩余的元素，分割成 左子序列 L 和 右子序列 R

def quick_sort(list):
	less = []
	more = []
	plist = []
	if len(list)<=1
		return list
	else:
		#把第一个数作为基准
		p = list[0]
		for i in list:
			if i<p:
				less.append(i)
			elif i>p:
				more.append(i)
			else:
				plist.append(i)
	less = quick_sort(less)	
	more = quick_sort(more)
	return less + plist + more

list = [7, 10, 8, 9, 1, 5]
print(quick_sort(list))