Multiple Choice
An algorithm is ____ if no work is done in the algorithm after a recursive call.
A) complex
B) iterative
C) infinite
D) tail-recursive
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q18: A recursive method must have a well-defined
Q19: When a method returns, its activation record
Q20: A large storage area known as a(n)
Q21: In a quicksort algorithm, the iterative approach
Q22: Identify the letter of the choice that
Q24: Identify the letter of the choice that
Q25: Because the summation algorithm must visit each
Q26: FIGURE 13-2 <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB8769/.jpg" alt="FIGURE 13-2
Q27: The big-O value O(1) is named logarithmic.
Q28: The big-O value O(n) is named _.