summaryrefslogtreecommitdiffstats
path: root/Bachelor/Prog1/examples/ch04/Ex04_18.cpp
blob: 9ccbc6ebde4b9806fc9d2fe2fc914e9f942ccde7 (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
// Ex. 4.18: ex04_18.cpp
// What does this program do?
#include <iostream>

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

int whatIsThis( int [], int );  // function prototype

int main()
{
   const int arraySize = 10;
   int a[ arraySize ] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };

   int result = whatIsThis( a, arraySize );

   cout << "Result is " << result << endl;

   return 0;  // indicates successful termination

} // end main

// What does this function do?
int whatIsThis( int b[], int size )
{
   // base case
   if ( size == 1 )
      return b[ 0 ];

   // recursive step
   else
      return b[ size - 1 ] + whatIsThis( b, size - 1 );

} // end function whatIsThis

/**************************************************************************
 * (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.                     *
 *************************************************************************/