Question

n algorithm is called recursive if it solves a problem by reducing the problem size while using the same input. True False

Answer 1

true

Step-by-step explanation:

the recursive algorithm will keep calling it own self until some condition is met, and the value for what it was looking for will be reduce after each execution.

CS Harvard free college course on YT has the great explanation on this.