Quote:
Originally Posted by LaurV
Edit: yep, the manual says it uses Brent (draw a secant from a to b, it intersects Ox, that is the new point, it matched with your output, well,

Ok, but for f(x)=x^3 it is weaker than the binary search. Just try this:
Code:
cnt=0;solve(x=1,2,cnt+=1;print(cnt" "x);x^3)
So it is doing at most 259 iterations.