





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)							-> Any:




    """simple docstring"""




    _A     =							(boundary[1] - boundary[0]) / steps
    _A     =							boundary[0]
    _A     =							boundary[1]
    _A     =							make_points(_SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)
    _A     =							0.0
    y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE				)
    for i in x_i:
        # print(i)
        y += h * f(_SCREAMING_SNAKE_CASE				)
    y += (h / 2.0) * f(_SCREAMING_SNAKE_CASE				)
    return y





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)							-> int:




    """simple docstring"""




    _A     =							a + h
    while x < (b - h):
        yield x
        _A     =							x + h





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE				)							-> Any:  # enter your function here




    """simple docstring"""




    _A     =							(x - 0) * (x - 0)
    return y





def 				__lowerCAmelCase(       )							-> Tuple:




    """simple docstring"""




    _A     =							0.0  # Lower bound of integration
    _A     =							1.0  # Upper bound of integration
    _A     =							10.0  # define number of steps or resolution
    _A     =							[a, b]  # define boundary of integration
    _A     =							method_a(_SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				)
    print(F"y = {y}"				)


if __name__ == "__main__":
 main()












import numpy as np





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE				)							-> np.array:




    """simple docstring"""




    return (2 / (1 + np.exp(-2 * vector				))) - 1


if __name__ == "__main__":
 import doctest

 doctest.testmod()





