text cover

Data Abstraction and Problem Solving with C++

Walls and Mirrors

by Frank M. Carrano

 Addison Wesley Logo

c01p030.cpp

Go to the documentation of this file.
00001 
00017 // computes the sum of item[0], item[1], ...,
00018 // item[n - 1] for any n >= 1
00019 int sum = 0;
00020 int j = 0;
00021 
00022 while (j < n)
00023 {  sum += item[j];
00024    ++j;
00025 }  // end while
Generated on Sat Aug 26 19:58:10 2006 for AWLogo by  doxygen 1.4.6