text: 
  
  
  
  def quickSort(arr, left=None, right=None):
      left = 0 if not isinstance(left, (int, float)) else left
      right = len(arr) - 1 if not isinstance(right, (int, float)) else ri  
      if left < right:
          partitionIndex = partition(arr, left, right)
          quickSort(arr, left, partitionIndex - 1)
          quickSort(arr, partitionIndex + 1, len(arr) - 1)
      return arr
  
  def partition(arr, left, right):
      pivot = left
      index = pivot + 1
      i = index 
      while i <= right:
          if arr[i] < arr[pivot]:
              arr[i], arr[index] = arr[index], arr[i]
              index += 1
          i += 1
      arr[pivot], arr[index - 1] = arr[index - 1], arr[pivot]
      return index - 1
  
  