
"""simple docstring"""
def 				lowerCamelCase_		(UpperCamelCase__	:	Optional[Any]							):
    _UpperCAmelCase							:						List[str]       							=					len(UpperCamelCase__							)
    for i in range(length - 1							):
        _UpperCAmelCase							:						List[Any]       							=					False
        for j in range(length - 1 - i							):
            if collection[j] > collection[j + 1]:
                _UpperCAmelCase							:						str       							=					True
                _UpperCAmelCase							:						Tuple       							=					collection[j + 1], collection[j]
        if not swapped:
            break  # Stop iteration if the collection is sorted.
    return collection


if __name__ == "__main__":
  import doctest
  import time

  doctest.testmod()

  _lowerCAmelCase					:List[Any]  =      input('Enter numbers separated by a comma:').strip()
  _lowerCAmelCase					:Optional[int]  =      [int(item) for item in user_input.split(',')]
  _lowerCAmelCase					:Union[str, Any]  =      time.process_time()
  print(*bubble_sort(unsorted), sep=',')
  print(f"Processing time: {(time.process_time() - start)%1E9 + 7}")







"""simple docstring"""
def 				lowerCamelCase_		(UpperCamelCase__	:	List[Any]  , UpperCamelCase__	:	int							):
    sequence.append(UpperCamelCase__							)

    _UpperCAmelCase							:						str       							=					0
    while sequence[index] != target:
        index += 1

    sequence.pop()

    if index == len(UpperCamelCase__							):
        return None

    return index


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

  _lowerCAmelCase					:int  =      input('Enter a single number to be found in the list:\n')
  _lowerCAmelCase					:List[Any]  =      int(target_input)
  _lowerCAmelCase					:Optional[int]  =      sentinel_linear_search(sequence, target)
  if result is not None:
    print(f"{target} found at positions: {result}")
  else:
    print('Not found')


