Quick Sort python

quick_sort.py

def quick_sort(lst):
    if len(lst) <= 1:
        return lst
    low, middle, high = [], [], []
    pivot = lst[0]
    for num in lst:
        if num < pivot:
            low.append(num)
        elif num > pivot:
            high.append(num)
        else:
            middle.append(num)
    low = quick_sort(low)
    high = quick_sort(high)
    return low + middle + high

print(quick_sort([0, 30, -40, 300, 10, 4, 34, -6]))