python-numpy-quickSort

def quickSort(arr):
    if len(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]

    return quickSort(left) + middle + quickSort(right)
print(quickSort([3,34,56,7,89,2,4]))