summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog1/examples/ch03/Ex03_50.cpp
blob: c887d3d4a3a55ad5be70a92e8a14d3e6d1bf6fad (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// Exercise 3.50: ex03_50.cpp
// What does this program do?
#include <iostream>

using std::cout;
using std::cin;
using std::endl;

int mystery( int, int );  // function prototype
      
int main()
{
   int x, y;
   
   cout << "Enter two integers: ";
   cin >> x >> y;
   cout << "The result is " << mystery( x, y ) << endl;

   return 0;  // indicates successful termination

} // end main
   
// Parameter b must be a positive
// integer to prevent infinite recursion
int mystery( int a, int b )
{
   // base case
   if ( b == 1 )
      return a;

   // recursive step
   else
      return a + mystery( a, b - 1 );

} // end function mystery


/**************************************************************************
 * (C) Copyright 1992-2003 by Deitel & Associates, Inc. and Prentice      *
 * Hall. All Rights Reserved.                                             *
 *                                                                        *
 * DISCLAIMER: The authors and publisher of this book have used their     *
 * best efforts in preparing the book. These efforts include the          *
 * development, research, and testing of the theories and programs        *
 * to determine their effectiveness. The authors and publisher make       *
 * no warranty of any kind, expressed or implied, with regard to these    *
 * programs or to the documentation contained in these books. The authors *
 * and publisher shall not be liable in any event for incidental or       *
 * consequential damages in connection with, or arising out of, the       *
 * furnishing, performance, or use of these programs.                     *
 *************************************************************************/