

"""simple docstring"""




def 		_lowercase			(					lowercase__						):
      __lowerCAmelCase :						Optional[Any] = len(SCREAMING_SNAKE_CASE_						)

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

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

            # Sort the elements using insertion sort
            for i in range(SCREAMING_SNAKE_CASE_       ,     len(SCREAMING_SNAKE_CASE_						)						):
                  __lowerCAmelCase :						int = collection[i]
                  __lowerCAmelCase :						Union[str, Any] = i
                  while j >= gap and collection[j - gap] > temp:
                        __lowerCAmelCase :						str = collection[j - gap]
                        j -= gap
                  __lowerCAmelCase :						List[Any] = temp

      return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()





def 		_lowercase			(					lowercase__						):
      return "".join(chr(ord(lowercase__						) + 3_2						) if '''A''' <= char <= '''Z''' else char for char in word						)


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

 testmod()


