Solved

Sum(n) =1+2+3

Question 42

Multiple Choice

sum(n) =1+2+3+...+n, where n>1 is an example of a(n) ____ algorithm.

A) recursive
B) iterative
C) complex
D) infinite

Related Questions

Q37: A _ sort algorithm computes the middle

Q38: Identify the letter of the choice that

Q39: The constant big-O value is _.<br>A) O(1)<br>B)

Q40: A(n) _ algorithm is one that refers

Q41: In a quicksort algorithm, the middle of

Q43: The _ search algorithm is O(log n).<br>A)

Q44: _ is an extra array used during

Q45: Recursion and iteration can never be used

Q46: Recursion is measured by looking at how

Q47: Identify the letter of the choice that