Register
n algorithm is called recursive if it solves a problem by reducing the problem size while using the same input. True False
218,459 views
9 votes
9 votes
n algorithm is called recursive if it solves a problem by reducing the problem size while using the same input. True False

User Nexen
by
3.6k points

1 Answer

1 vote
1 vote

Answer:

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.

User Datt
by
3.1k points
Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

3.2m questions

4.1m answers

Other Questions

Assume you have created a mechanical arm that can hold a pen. The arm can perform the following tasks: • Lower the pen to a piece of paper. • Raise the pen from the paper. • Move the pen 1 inch along a
Drag each connector name to match the connector type shown.
What problem does chlorofluorocarbon (CFC) create? a. it causes lead poisoning b.it causes great damage to the ozone layer c. it leaks into food as it cools the air and refrigerators d. it is responsible
What do customers typically notice during virtual interactions?
Tom is very curious as to whether terrorism is truly linked to levels of religiosity around the world. As such, he gathers data from the Global Terrorism Database and the World Religion Dataset and examines
Link Copied!