





from __future__ import annotations


def        A__						(							SCREAMING_SNAKE_CASE_		) ->  Tuple:





		if len(lowerCamelCase_		) == 0:
				raise ValueError('''find_max() arg is an empty sequence'''		)
		lowerCamelCase :			Optional[int]    		=nums[0]
		for x in nums:
				if x > max_num:
						lowerCamelCase :			int    		=x
		return max_num


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)


'''simple docstring'''


def    _lowerCamelCase       ( lowerCamelCase_   :				list  ):



     """simple docstring"""





     UpperCAmelCase_				:  Optional[int]  = len(lowerCamelCase_  )

     # Set the gap value to be decreased by a factor of 1.3
     # after each iteration
     UpperCAmelCase_				:  Optional[Any]  = 1.3

     # Continue sorting until the gap is 1
     while gap > 1:
          # Decrease the gap value
          UpperCAmelCase_				:  Optional[Any]  = int(gap / shrink  )

          # Sort the elements using insertion sort
          for i in range(lowerCamelCase_      ,	len(lowerCamelCase_  )  ):
               UpperCAmelCase_				:  Optional[int]  = collection[i]
               UpperCAmelCase_				:  Tuple  = i
               while j >= gap and collection[j - gap] > temp:
                    UpperCAmelCase_				:  Tuple  = collection[j - gap]
                    j -= gap
               UpperCAmelCase_				:  Optional[int]  = temp

     return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()






