This document contains code to solve quadratic equations and find roots of functions using the bisection method. The quadratic equation code calculates the discriminant and uses it to determine the number and type of roots, printing the result. The bisection method code iteratively calculates the midpoint between guesses for a root and determines if the next guess should be the lower or upper value based on the sign of the function at each point until convergence within a set tolerance.