Python 实现快排序

默写快排序 

import os,sys

class Solution(object):
	def __init__(self):
		pass

	def quick_sort(self, list1):
		if len(list1) == 0 or len(list1) == 1:
			return list1         #注意第归退出条件
		i = 0
		j = len(list1)
		key = list1[i]
		left = []
		right =  []
		list1.remove(key)       #容易遗忘的一步
		for item in list1:
			if item > key:
				left.append(item)
			else:
				right.append(item)

		return self.quick_sort(left) + [key] + self.quick_sort(right)

if __name__ == '__main__':
	sol = Solution()
	list1 = [1,3,2,2,1,2,4,4,5,6]
	print sol.quick_sort(list1)