


'''simple docstring'''

def _SCREAMING_SNAKE_CASE				(A  ,			A	)	->	list:






       """simple docstring"""







       lowercase__				      =			len(A	)
       lowercase__				      =			len(A	)
       lowercase__				      =			(
           first_input_list_length
           if first_input_list_length > second_input_list_length
           else second_input_list_length
       )
       lowercase__				      =			[]
       for char_count in range(A	):
              if char_count < first_input_list_length:
                     output_result_list.append(first_input_list[char_count]	)
              if char_count < second_input_list_length:
                     output_result_list.append(second_input_list[char_count]	)

       return output_result_list


if __name__ == "__main__":
 print(alternative_list_arrange(['A', 'B', 'C'], [1, 2, 3, 4, 5]), end=' ')








'''simple docstring'''

def _SCREAMING_SNAKE_CASE				(A	)	->	list:






       """simple docstring"""







       lowercase__				      =			len(A	)

       # 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(A  ,			len(A	)	):
                     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()




