Give a big-O estimate for the number of operations (where an operation is an addition or a multiplication) used in this segment of an algorithm:
Explain your answer.
Here there is one loop. In this loop, there are instances of the value .
For each value of , there is one calculation: . Each such calculation uses three operations: one instance of addition and two instances of multiplication ().
Therefore, the total number of operations is , which is a quadratic polynomial, so it is .