


def 			_a      (    __UpperCamelCase			):
     a_     :  Any				      =     [7_0_1, 3_0_1, 1_3_2, 5_7, 2_3, 1_0, 4, 1]
     for gap in gaps:
          for i in range(__UpperCamelCase	,	len(__UpperCamelCase			)			):
               a_     :  Optional[int]				      =     collection[i]
               a_     :  Dict				      =     i
               while j >= gap and collection[j - gap] > insert_value:
                    a_     :  int				      =     collection[j - gap]
                    j -= gap
               if j != i:
                    a_     :  List[str]				      =     insert_value
     return collection


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

       testmod()
       __lowerCamelCase   	=  input('''Enter numbers separated by a comma:\n''').strip()
       __lowerCamelCase   	=  [int(item) for item in user_input.split(''',''')]
       print(shell_sort(unsorted))




lowerCAmelCase      :				Union[str, Any]     			=1000







def     A__	(       __A						):







    '''simple docstring'''
    return x * x







def     A__	(       __A ,			__A ,			__A ,			__A = 4						):







    '''simple docstring'''
    assert callable(
        __A						), F"""the function(object) passed should be callable your input : {function}"""
    assert isinstance(__A ,			(float, int)						), F"""a should be float or integer your input : {a}"""
    assert isinstance(function(__A						) ,			(float, int)						), (
        "the function should return integer or float return type of your function, "
        F"""{type(__A						)}"""
    )
    assert isinstance(__A ,			(float, int)						), F"""b should be float or integer your input : {b}"""
    assert (
        isinstance(__A ,			__A						) and precision > 0
    ), F"""precision should be positive integer your input : {precision}"""

    # just applying the formula of simpson for approximate integration written in
    # mentioned article in first comment of this file and above this function

    _lowerCamelCase  :		Optional[Any]			    =    (b - a) / N_STEPS
    _lowerCamelCase  :		str			    =    function(__A						) + function(__A						)

    for i in range(1 ,			__A						):
        _lowerCamelCase  :		str			    =    a + h * i
        result += function(__A						) * (4 if i % 2 else 2)

    result *= h / 3
    return round(__A ,			__A						)


if __name__ == "__main__":
    import doctest

    doctest.testmod()




