



def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       len(snake_case     )

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

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

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

					return collection


if __name__ == "__main__":
	import doctest

	doctest.testmod()








def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       str(snake_case     ).strip()
					if not bin_string:
										raise ValueError("""Empty string was passed to the function"""     )
					_lowerCAmelCase         =       bin_string[0] == """-"""
					if is_negative:
										_lowerCAmelCase         =       bin_string[1:]
					if not all(char in """01""" for char in bin_string     ):
										raise ValueError("""Non-binary value was passed to the function"""     )
					_lowerCAmelCase         =       0
					for char in bin_string:
										_lowerCAmelCase         =       2 * decimal_number + int(snake_case     )
					return -decimal_number if is_negative else decimal_number


if __name__ == "__main__":
	from doctest import testmod

	testmod()



