inefct1.cpp

数据结构c++语言描述 Borland C++实现

// ineffficient prefix sums

#include <iostream.h>

int count = 0;

template <class T>
void Inef(T a[], T b[], int n)
{// Compute prefix sums.
   for (int j = 0; j < n; j++) {
      count++;
      b[j] = Sum(a, j + 1);
      count++;}
   count++;
}

template <class T>
T Sum(T a[], int n)
{// Return sum of numbers a[0:n - 1].
   T tsum = 0;
   count++;
   for (int i = 0; i < n; i++) {
      count++;
      tsum += a[i];
      count++;
      }
    count++;
    count++;
   return tsum;
}

void main(void)
{
   int a[6] = {1, 2, 3, 4, 5, 6};
   int b[6];
   int n = 6;
   Inef(a,b,n);
   for (int i = 0; i < n; i++)
      cout << b[i] << ' ';
   cout << endl;
   cout << "Step count is " << count << endl;
}