code: 
  
  
  
  from __future__ import annotations
  
  from random import randrange
  
  
  
  
  def     UpperCAmelCase__ (							__snake_case							):
    if len(lowercase__							) < 2:
      return collection
    _A           =    randrange(len(lowercase__							)							)  # Use random element as pivot
    _A           =    collection[pivot_index]
    _A           =    []  # All elements greater than pivot
    _A           =    []  # All elements less than or equal to pivot
  
    for element in collection[:pivot_index]:
      (greater if element > pivot else lesser).append(lowercase__							)
  
    for element in collection[pivot_index + 1 :]:
      (greater if element > pivot else lesser).append(lowercase__							)
  
    return [*quick_sort(lowercase__							), pivot, *quick_sort(lowercase__							)]
  
  
  if __name__ == "__main__":
      __lowerCamelCase  				=					input("""Enter numbers separated by a comma:\n""").strip()
      __lowerCamelCase  				=					[int(item) for item in user_input.split(""",""")]
      print(quick_sort(unsorted))
style_context: 
  
  
  
  def     UpperCAmelCase__ (							__snake_case						,				__snake_case = 1_000							)   -> str:
    if (not isinstance(__snake_case						,				__snake_case							)) or (digit_position <= 0):
      raise ValueError('''Digit position must be a positive integer'''							)
    elif (not isinstance(__snake_case						,				__snake_case							)) or (precision < 0):
      raise ValueError('''Precision must be a nonnegative integer'''							)
  
    # compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly
    # accurate
    _A           =    (
        4 * _subsum(__snake_case						,				1						,				__snake_case							)
        - 2 * _subsum(__snake_case						,				4						,				__snake_case							)
        - _subsum(__snake_case						,				5						,				__snake_case							)
        - _subsum(__snake_case						,				6						,				__snake_case							)
    )
  
    # return the first hex digit of the fractional part of the result
    return hex(int((sum_result % 1) * 16							)							)[2:]
  
  
  
  
  def     UpperCAmelCase__ (							__snake_case						,				__snake_case						,				__snake_case							)   -> float:
    _A           =    0.0
    for sum_index in range(digit_pos_to_extract + precision							):
      _A           =    8 * sum_index + denominator_addend
      if sum_index < digit_pos_to_extract:
        # if the exponential term is an integer and we mod it by the denominator
        # before dividing, only the integer part of the sum will change;
        # the fractional part will not
        _A           =    pow(
            16						,				digit_pos_to_extract - 1 - sum_index						,				__snake_case							)
      else:
        _A           =    pow(16						,				digit_pos_to_extract - 1 - sum_index							)
      total += exponential_term / denominator
    return total
  
  
  if __name__ == "__main__":
      import doctest
  
      doctest.testmod()