quicksort running time quick sort average case is on log n each level takes on but splitting the data is olog n on olog n on log n worse case is olog n2 if pivot is smallest value each level is on and splitting the data is on on on on2 quicksort function quicksort function 1 5 27 36 41 72 78 80 99 100
def quicksort(array):
    if len(array) < 2:
        return array
    else:
        pivot = array[0]
        less = [i for i in array[1:] if i <= pivot]
        greater = [i for i in array[1:] if i > pivot]
        return quicksort(less) + [pivot] + quicksort(greater)

array = [100, 5, 72, 41, 80, 1, 99, 36, 27, 78]
print(quicksort(array))