fastest polynomial algorithm
For evaluation of a general polynomial in one variable, the provably fastest method is Horner's scheme as Emil has pointed out. It is worth mentioning that this scheme has a more popular face in the form of little BÃ©zout's theorem paired with Synthetic division as is often taught in Precalculus courses in the U.S.A.