function [p,niter]=bisec(f,a,b,tol,n0) i=1; fa=feval(f,a) while i<=n0 p=a+(b-a)/2; fp=feval(f,p) if fp==0|(b-a)/2<tol niter=i return end i=i+1 if fa*fp>0 a=p fa=fp else b=p; end end disp('n0 est deppass?, echec de la procedure')