The bisection method which is a type of method and algorithm for finding roots of functions where $f(x) = 0$ of a continuous function by repeatedly halving an interval $[a, b]$ where the function changes sign
\[f(a) \times f(b) < 0\]In Python you can do this with
import numpy as np
x = np.linspace(0, 10, 100)
print(x[:5])
