[정렬] 퀵소트

# 퀵소트 

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    # 피봇 설정 - (중간위치)
    pivot = arr[len(arr) // 2]
    left_arr, equal_arr, right_arr = [], [], []
    # 
    for num in arr:
        if num < pivot:
            left_arr.append(num)
        elif num > pivot:
            right_arr.append(num)
        else:
            equal_arr.append(num)
    return quick_sort(left_arr) + equal_arr + quick_sort(right_arr)

  
arr= [20,50,30,40,99]
print(quick_sort(arr))