input: [25, 20, 15, 8, 5]
instruction: Írj quicksortot python nyelven.
output: Íme a quicksort implementációja Pythonban:
  
  ```python
  def quicksort(arr):
      if len(arr) <= 1:
          return arr
      else:
          pivot = arr[0]
          left = []
          right = []
          for num in arr[1:]:
              if num < pivot:
                  left.append(num)
              else:
                  jobb.append(num)
          return quicksort(left) + [pivot] + quicksort(right)
  
  arr = [25, 20, 15, 8, 5]
  print(quicksort(arr))
  ```
  
  A kimenet a megadott `[25, 20, 15, 8, 5]` bemenetre a `[5, 8, 15, 20, 25]` lesz.