quick sort array

def quicksort(lst):
  
  if len(lst) <= 1:
    return lst
  
  pivot = lst[0]
  left = [x for x in lst[1:] if x < pivot]
  right = [x for x in lst[1:] if x >= pivot]
  
  return quicksort(left) + [pivot] + quicksort(right)
  
  
quicksort([3, 2, 5, 1, 9])