Python 手寫快排序

import os,sys


class solution(object):
	
	def __init__(self):
		pass
	
	def quick_sort(self, list1):
		
		l = len(list1)
		if l < 2:
			return list1
		left = []
		right = []
		k=list1[0]

		for i in range(1, l):
			item= list1[i]
			if item > k:
				left.append(item)
			else:
				right.append(item)
		return self.quick_sort(left) + [k] + self.quick_sort(right)

if __name__ == '__main__':
	s = solution()
	list1 = [1,4,2,5,0,45,3,55555,3]
	print s.quick_sort(list1)