Bisection method or binary-search method role and purposes Sharma Prassan1 1Associate Professor, Integrated Academy of Management and Technology, Ghaziabad, Uttar Pradesh, India Online published on 30 August, 2024. Abstract The essential way of getting a root is the bisection method. When iterations are applied, the interval length gets hafted. Therefore, this Method guarantees the convergence of a root to "g" if the given function "g" is continuous at a [a,b] and the signs of g(a) and g(b) are opposite. This Research paper explains the role of the binary search method in computer science. We presented a modern strategy, which may be a mixture of binary search and other strategies, to demonstrate that with the assistance of the binary search strategy, we can create modern strategies. It is shown that researchers and engineers faced problems in finding the roots of equations by using a basic method, which is a binary search method, but it is equivalently leaden. We can present this recent approach to solve such issues and to enhance the convergence. Top Keywords Absolute Error, Iteration Method, Convergence Rate, N-R method, Method of False Position. Top |