
def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE							):
 lowercase					  =   len(__lowercase							)

 # Set the gap value to be decreased by a factor of 1.3
 # after each iteration
 lowercase					  =   1.3

 # Continue sorting until the gap is 1
 while gap > 1:
  # Decrease the gap value
  lowercase					  =   int(gap / shrink							)

  # Sort the elements using insertion sort
  for i in range(__lowercase			,							len(__lowercase							)							):
   lowercase					  =   collection[i]
   lowercase					  =   i
   while j >= gap and collection[j - gap] > temp:
    lowercase					  =   collection[j - gap]
    j -= gap
   lowercase					  =   temp

 return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()



import unittest
from timeit import timeit






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE			,							__SCREAMING_SNAKE_CASE							):
	lowercase					  =   first_num if first_num >= second_num else second_num
	lowercase					  =   max_num
	while (common_mult % first_num > 0) or (common_mult % second_num > 0):
		common_mult += max_num
	return common_mult






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE			,							__SCREAMING_SNAKE_CASE							):
	return b if a == 0 else greatest_common_divisor(b % a			,							__SCREAMING_SNAKE_CASE							)






def 							UpperCAmelCase_		(							__SCREAMING_SNAKE_CASE			,							__SCREAMING_SNAKE_CASE							):
	return first_num // greatest_common_divisor(__SCREAMING_SNAKE_CASE			,							__SCREAMING_SNAKE_CASE							) * second_num






def 							UpperCAmelCase_		(							):
	lowercase					  =   (
	    'from __main__ import least_common_multiple_slow, least_common_multiple_fast'
	)
	print(
	    'least_common_multiple_slow():'			,							timeit('least_common_multiple_slow(1000, 999)'			,							setup=__SCREAMING_SNAKE_CASE							)			,							)
	print(
	    'least_common_multiple_fast():'			,							timeit('least_common_multiple_fast(1000, 999)'			,							setup=__SCREAMING_SNAKE_CASE							)			,							)







class 	A_       (      unittest.TestCase       ):




	'''simple docstring'''


	_UpperCamelCase					:					Any										=	(
	    (10, 20),
	    (13, 15),
	    (4, 31),
	    (10, 42),
	    (43, 34),
	    (5, 12),
	    (12, 25),
	    (10, 25),
	    (6, 9),
	)
	_UpperCamelCase					:					int										=	(20, 195, 124, 210, 1462, 60, 300, 50, 18)





	def      SCREAMING_SNAKE_CASE__						(	self	):
		for i, (first_num, second_num) in enumerate(self.test_inputs	):
			lowercase					  =   least_common_multiple_slow(snake_case		,   snake_case	)
			lowercase					  =   least_common_multiple_fast(snake_case		,   snake_case	)
			with self.subTest(i=snake_case	):
				self.assertEqual(snake_case		,   self.expected_results[i]	)
				self.assertEqual(snake_case		,   self.expected_results[i]	)


if __name__ == "__main__":
	benchmark()
	unittest.main()

