Answer:
The Big-O notation of the algorithm is O(n)
Explanation:
The declaration and update of the integer variable sum is a constant of O(1). The for loop statement, however, would repeat relative to the size of "n", increasing the counter variable and updating the sum total by the counter.
