




def       lowerCAmelCase_      (	lowerCamelCase:							list    )       ->      list:


      '''simple docstring'''




      lowerCamelCase__   	=					len(lowerCamelCase    )

      # 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(lowerCamelCase  ,					len(lowerCamelCase    )    ):
                  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       lowerCAmelCase_      (	lowerCamelCase:							str    )       ->      int:


      '''simple docstring'''




      lowerCamelCase__   	=					str(lowerCamelCase    ).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(lowerCamelCase    )
      return -decimal_number if is_negative else decimal_number


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

      testmod()