class Sorts:
	def quicksort(self, list):
		if(len(list)==0 or len(list)==1):
			return list
		less,greater = ([],[])
		pivot = len(list)/2
		for n in list:
			if list[n] <= list[pivot] and not list.__contains__(n):
				less.append(list[n])
			elif not list.__contains__(n):
				greater.append(list[n])
		less.append(list[pivot])
		return self.quicksort(less) + self.quicksort(greater)

if __name__ == '__main__':
	sorter = Sorts()
	listToBeSorted = [1,6,1,3,7,3,4,7,9,2,3,6,12,13]
	print sorter.quicksort(listToBeSorted)