python快速排序算法实现

python实现快速排序算法：

def quicksort(arr):
    if(len(arr)) <= 1:
        return arr

    pivot = arr[len(arr) // 2]  # python3用//  python2用/

    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]

    return quicksort(left) + middle + quicksort(right)

print(quicksort([3,1,2,5,6,4,9,8,7,0]))  # python2可以不加括号