
'''simple docstring'''
def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    for index, item in enumerate(__SCREAMING_SNAKE_CASE							):
        if item == target:
            return index
    return -1

def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    if not (0 <= high < len(__SCREAMING_SNAKE_CASE							) and 0 <= low < len(__SCREAMING_SNAKE_CASE							)):
        raise Exception("Invalid upper or lower bound!"							)
    if high < low:
        return -1
    if sequence[low] == target:
        return low
    if sequence[high] == target:
        return high
    return rec_linear_search(__SCREAMING_SNAKE_CASE,		low + 1,		high - 1,		__SCREAMING_SNAKE_CASE							)


if __name__ == "__main__":
  a_           =    input("Enter numbers separated by comma:\n").strip()
  a_           =    [int(item.strip()) for item in user_input.split(",")]

  a_           =    int(input("Enter a single number to be found in the list:\n").strip())
  a_           =    linear_search(sequence, target)
  if result != -1:
    print(f"""linear_search({sequence}, {target}) = {result}""")
  else:
    print(f"""{target} was not found in {sequence}""")






'''simple docstring'''
def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    if right <= left:
        return
    snake_case_			:     Dict        =    left
    snake_case_			:     Tuple        =    right
    snake_case_			:     List[str]        =    sorting[left]
    while i <= b:
        if sorting[i] < pivot:
            snake_case_      ,			snake_case_			:     Union[str, Any]        =    sorting[i], sorting[a]
            a += 1
            i += 1
        elif sorting[i] > pivot:
            snake_case_      ,			snake_case_			:     List[str]        =    sorting[i], sorting[b]
            b -= 1
        else:
            i += 1
    quick_sort_apartition(__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		a - 1							)
    quick_sort_apartition(__SCREAMING_SNAKE_CASE,		b + 1,		__SCREAMING_SNAKE_CASE							)

def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    if left < right:
        snake_case_			:     Dict        =    lomuto_partition(__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							)
        quick_sort_lomuto_partition(__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		pivot_index - 1							)
        quick_sort_lomuto_partition(__SCREAMING_SNAKE_CASE,		pivot_index + 1,		__SCREAMING_SNAKE_CASE							)

def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    snake_case_			:     List[Any]        =    sorting[right]
    snake_case_			:     Optional[int]        =    left
    for i in range(__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
        if sorting[i] < pivot:
            snake_case_      ,			snake_case_			:     Dict        =    sorting[i], sorting[store_index]
            store_index += 1
    snake_case_      ,			snake_case_			:     Optional[Any]        =    sorting[store_index], sorting[right]
    return store_index

def     UpperCamelCase_  (						__SCREAMING_SNAKE_CASE							):
    """simple docstring"""






    if len(__SCREAMING_SNAKE_CASE							) <= 1:
        return sorting
    return (
        three_way_radix_quicksort([i for i in sorting if i < sorting[0]]							)
        + [i for i in sorting if i == sorting[0]]
        + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]							)
    )


if __name__ == "__main__":
  import doctest

  doctest.testmod(verbose=True)

  a_           =    input("Enter numbers separated by a comma:\n").strip()
  a_           =    [int(item) for item in user_input.split(",")]
  quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
  print(unsorted)




