input: from typing import List
  
  def recursive_sort(numbers: List[int]) -> List[int]:
      """
      Sort a given list of numbers using a recursive approach.
  
      >>> recursive_sort([3, 1, 4, 1, 5, 9, 2, 6, 5])
      [1, 1, 2, 3, 4, 5, 5, 6, 9]
      >>> recursive_sort([7, 3, 8, 9, 1])
      [1, 3, 7, 8, 9]
      """
      # Implementation here
      pass
output:     if len(numbers) <= 1:
          return numbers
      else:
          pivot = numbers[0]
          less = [x for x in numbers[1:] if x <= pivot]
          greater = [x for x in numbers[1:] if x > pivot]
          return recursive_sort(less) + [pivot] + recursive_sort(greater)