Horner's Method is a method of expressing a polynomial f(x) = a_{n} x^{n} + a_{n–1} x^{n–1} + . . . + a_{2} x^{2} + a_{1} x^{1} + a_{0} x^{0} which eliminates all exponentiations. The elimination of exponentiations, eliminates redoing some calculations.
In NSD, we have

In C++, we have
