def quick_sort(arr):iflen(arr)<=1:return arr
pivot = arr[len(arr)// 2]
left =[x for x in arr if x < pivot]
middle =[x for x in arr if x == pivot]
right =[x for x in arr if x > pivot]returnquick_sort(left)+ middle +quick_sort(right)
def merge_sort(arr):iflen(arr)<=1:return arr
mid =len(arr)// 2
left =merge_sort(arr[:mid])
right =merge_sort(arr[mid:])returnmerge(left, right)
def merge(left, right):
result =[]
i = j =0while i <len(left) and j <len(right):if left[i]< right[j]:
result.append(left[i])
i +=1else:
result.append(right[j])
j +=1
result += left[i:]
result += right[j:]return result