Question: Computing factorials lends itself to recursion because _________________. a. It is impossible to compute a factorial using a loop b. Recursion is most useful for
Computing factorials lends itself to recursion because _________________.
a. It is impossible to compute a factorial using a loop
b. Recursion is most useful for all mathematical computations
c. Computing the factorial of any number relies on computing the factorial of a simpler case
d. The series of if statements required to compute a factorial iteratively would be lengthy
Step by Step Solution
3.34 Rating (160 Votes )
There are 3 Steps involved in it
c Computing factorials lends ... View full answer
Get step-by-step solutions from verified subject matter experts
