파이썬 퀵 정렬

def quick_sort(st):
	if len(st) <= 1:
		return st
	
	pivot = st[0]
	tail = st[1:]
	
	left_side = [x for x in tail if x <= pivot]
	right_side = [x for x in tail if x >= pivot]

	return quick_sort(left_side) + [pivot] + quick_sort(right_side)

print(quick_sort([1, 2, 5, 3, 7, 6, 9])