퀵 정렬 / 병합 정렬

퀵 정렬

def quick_sort(arr):
	if len(arr) <= 1: return arr
	pivot = arr.pop()
	left, right = [], []
	for x in arr:
		if x < pivot:
			left.append(x)
		else:
			right.append(x)
	return quick_sort(left) + [pivot] + quick_sort(right)

병합 정렬

def merge_sort(arr):
	if len(arr) <= 1: return arr
	center = len(arr) // 2
	left, right = merge(arr[:center]), merge(arr[center:])
	result = []
	l = r = 0
	while l < len(left) and r < len(right):
		if left[l] < right[r]:
			result.append(left[l])
			l += 1
		else:
			result.append(right[r])
			right += 1
	return result + left[l:] + right[r:]