SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.


To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

 

#
Authors:
Walter Savitch ,julia Lobur
Chapter:
Recursion
Exercise:
Self-test Exercises
Question:7 | ISBN:9780321531346 | Edition: 7

Question

Write an iterative version of the function cheers defined in Self-Test Exercise 1.

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

Before start the program, see the recursion function of 'cheers' in Self-Test Exercise1. Now need to convert from recursive function to iterative function.

Iterative function of 'cheers ':

//Iterative version of the function 'cheers'
//Function "cheers" accept an integer parameter value of n
//and check the while loop condition to print result on screen
void cheers(int n)
{
    while (n > 1)
    {
        cout << "Hip ";
       n--;
    }
    cout << "Hurray\n";
}

Complete program by using above iterative function:

//Header section
#include <iostream>
using namespace std;
//Function prototype
void cheers(int n);

//main program
int main( )

{
    //Call the method
    cheers(3);
    return 0;
}
//Iterative version of the function 'cheers'
//Function "cheers" accept an integer parameter value of n
//and check the while loop condition to print result on screen
void cheers(int n)
{
    while (n > 1)
    {
        cout << "Hip ";
       n--;
    }
    cout << "Hurray\n";
}

Output of the program:

0 0

Discussions

Post the discussion to improve the above solution.