(related to Algorithm: Horner Scheme)
The time complexity \(\mathcal O(n)\) (worst case and average case) of \(\mathtt{horner}(n,x,a)\) follows immediately from its \(\mathtt{FOR}\) \(\mathtt{NEXT}\) loop.
Thank you to the contributors under CC BY-SA 4.0!
