Starting Out With C++: Early Objects (10th Edition)
Starting Out With C++: Early Objects (10th Edition)
10th Edition
ISBN: 9780135235003
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: PEARSON
bartleby

Concept explainers

bartleby

Videos

Textbook Question
Book Icon
Chapter 14, Problem 1RQE

What type of recursive function do you think would be more difficult to debug; one that uses direct recursion or one that uses indirect recursion? Why?

Expert Solution & Answer
Check Mark
Program Plan Intro

Recursive Function:

  • The function has ability to call itself is called recursion function.
  • It is a substitute method for reiteration.
  • It replaces the loop statements, so without loop statement it executes the algorithm codes a number of times.
  • Selection statement is used to make a decision for the execution of the recursion.
  • There are two types of recursive functions. They are:
    • Direct recursion
    • Indirect recursion

Direct recursion:

When a function calls itself repeatedly until the condition becomes false is called as direct recursion.

Example:

//method definition

void test()

{

    //call a function

    test();

}

Indirect recursion:

When a function calls another function which in turn calls the same calling function is called as indirect recursion.

Example:

//method definition

void test()

{

    //call a function

    test1();

}

//method definition

void test1()

{

    //call a function

    test();

}

Explanation of Solution

Recursion that is difficult to debug:

The recursion that is difficult to debug is “Indirect recursion”.

Justification:

  • Because, a function calls one function which is linked to another function.
  • Since, a function can make multiple calls to a function; it is difficult to track the flow control of function that is being processed within the code.

Therefore, “Indirect recursion” is difficult to debug when compared to direct recursion.

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
What type of recursive function do you think would be more difficult to debug; one that uses direct recursion, or one that uses indirect recursion? Why?
Why does the recursive function that uses recursion to solve a problem have to call itself in order to resolve a smaller version of the original problem?
Indirect recursion is when function A calls  function B, which in turn calls function A.   is it true or false.

Additional Engineering Textbook Solutions

Find more solutions based on key concepts
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Computational Software for Intelligent System Design; Author: Cadence Design Systems;https://www.youtube.com/watch?v=dLXZ6bM--j0;License: Standard Youtube License