%Bisection Method
%This method will calculate the root of a user-defined function by halving  
%the given interval until the desired convergence is aquired
%
%f = function who's root will be found
%enda = minimum value at which to look for a root
%endb = maximum value at wich to look for a root
%TOL = if abs(midp-enda) < TOL, stop searching for a root, where midp
%is the midpoint b/w enda & endb
%N = maximum number of iterations can use to look for a root
function [root] = bisection(f,enda,endb,TOL,N)

F_a=f(enda);
F_b=f(endb);

i=1; %set iteration counter
while(i<N)
    midp = abs((endb-enda)/2)+enda; %get the midpoint between the two ends
    F_p = f(midp);
    
    i=i+1; %increase iteration counter
    
    %check if have converged
    if (abs(F_p) < TOL || abs(midp-enda)<TOL)
        root=midp;
        return
    end
    
    %determine which interval (a-p or p-b) to use for following iteration
    if F_a*F_p<0  
        endb = midp;
        F_b=F_p;
    else
        enda = midp;
        F_a = F_p;
    end
end

end