The bisection method is the basic method of finding a root. As iterations are conducted, the interval gets halved. So method is guaranteed to converge to a root of “f” if “f” is a continuous function at an interval [a,b] and f(a) and f(b) should have opposite sign. In this paper we have explained the role of bisection method in computer science research. we also introduced a new method which is a combination of bisection and other methods to prove that with the help of bisection method we can also develop new methods. It is observed that scientists and engineers are often faced with the task of finding out the roots of equations and the basic method is bisection method but it is comparatively slow. We can use this new method to solve these problems and to improve the speed.