Question: fsolve versus RootFinding

I executed finding the roots of the derivative of a series expansion containing 500 terms.  I did it 2 ways.  The 1st using fsolve & the 2nd using RootFinding.  The fsolve took over 20 minutes to find a single root within a specified range while the RootFinding took less than 60 seconds to find all roots within a larger range.  I do not know of the inner mechanisms of either command, but why is this the case?  Why would the algorithms differ?  My results are in the link below.

fsolve_vs_RootFinding.mw

Please Wait...