

'''simple docstring'''
def        _lowerCAmelCase					(						_UpperCamelCase						:     list							, _UpperCamelCase						:     int = 0				)      ->			list:
     """simple docstring"""




     _SCREAMING_SNAKE_CASE							    =length or len(_UpperCamelCase				)
     _SCREAMING_SNAKE_CASE							    =False
     for i in range(length - 1				):
          if list_data[i] > list_data[i + 1]:
               _SCREAMING_SNAKE_CASE    ,						_SCREAMING_SNAKE_CASE							    =list_data[i + 1], list_data[i]
               _SCREAMING_SNAKE_CASE							    =True

     return list_data if not swapped else bubble_sort(_UpperCamelCase							, length - 1				)


if __name__ == "__main__":
     import doctest

     doctest.testmod()





A__  :  Any								=					'''Tobias Carryer'''

from time import time



class 				__snake_case						:




							def __init__(       self     :       Any				,				A_     :       Tuple				,				A_     :       Dict				,				A_     :       Tuple				,				A_     :       str=int(time())):  # noqa: B008
									lowerCAmelCase_			:     int									= multiplier
									lowerCAmelCase_			:     int									= increment
									lowerCAmelCase_			:     str									= modulo
									lowerCAmelCase_			:     str									= seed







							def    UpperCAmelCase__			(       self     :       int):
									lowerCAmelCase_			:     Optional[int]									= (self.multiplier * self.seed + self.increment) % self.modulo
									return self.seed


if __name__ == "__main__":
						# Show the LCG in action.
						A__  :  Union[str, Any]								=					LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
						while True:
												print(lcg.next_number())





