sum(n) =1+2+3+...+n, where n1 is an example of a(n) ____ algorithm.
A) recursive
B) iterative
C) complex
D) infinite

Question

sum(n) =1+2+3+...+n, where n>1 is an example of a(n) ____ algorithm.
A) recursive
B) iterative
C) complex
D) infinite

Quizplus · Accepted Answer

The sum(n) algorithm is iterative because it uses a loop to repeatedly add numbers from 1 to n. It does not call itself or use any functions to solve the problem, which are characteristics of a recursive algorithm. The algorithm is not complex, and it is not infinite since it only runs for a finite number of steps (i.e. n).

Sum(n) =1+2+3