python快速排序

def quick_sort(list):
    list_3 = []
    list_1 = []
    list_2 = []
    if len(list) <=1:
        return list
    else:
        min = list[0]
        for i in list:
            if i > min:
                list_1.append(i)
            elif i < min:
                list_2.append(i)
            elif i == min:
                list_3.append(i)
        list_1 =  quick_sort(list_1)
        list_2 = quick_sort(list_2)
        return list_2+list_3+list_1
list = [2,3,1,6,9,4,5]
r = quick_sort(list)
print(r)