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

Question

Quizplus · Accepted Answer

Tail recursion is a technique where the last operation of the recursive function is a recursive call. This means that no operation is executed after the recursive call, making it easier for the compiler to optimize and potentially avoid stack overflow errors. Therefore, a tail-recursive algorithm is one in which no work is done after a recursive call.

An Algorithm Is ____ If No Work Is Done in the Algorithm