d.cpp

datastucutre and algorithms, application, in C

// function for Chapter 2 exercise

#include <iostream>
#include <algorithm>

using namespace std;

void d(int x[], int n)
{
   for (int i = 0; i < n; i += 2)
      x[i] += 2;

   i = 1;
   while (i <= n/2)
   {
      x[i] += x[i+1];
      i++;
   }
}

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

   // output the array elements
   cout << "a[0:9] = ";
   copy(a, a+10, ostream_iterator<int>(cout, " "));
   cout << endl;
   
   d(a,n);

   cout << "Completed function d(y,10)" << endl;

   // output the array elements
   cout << "a[0:9] = ";
   copy(a, a+10, ostream_iterator<int>(cout, " "));
   cout << endl;

   return 0;
}