Illustrating the generic partial_sum algorithm : array algorithms « STL Introduction « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » STL Introduction » array algorithms

14.1.6.Illustrating the generic partial_sum algorithm

#include <algorithm>

#include <numeric>

#include <iostream>

using namespace std;



int main()

{

  const int N = 20;

  int x1[N], x2[N];



  for (int i = 0; i < N; ++i)

    x1[i] = i;



  // Compute the partial sums of 0, 1, 2, 3, ..., N - 1, putting the result inx2:

  partial_sum(&x1[0], &x1[N], &x2[0]);



  for (int i = 0; i < N; ++i)

    cout << x2[i] << " ";



  return 0;

}

0 1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190

14.1.array algorithms
	14.1.1.	Using the STL generic reverse algorithm with an array
	14.1.2.	Using reverse_copy to copy the array reversely
	14.1.3.	Use random_shuffle algorithms with array
	14.1.4.	Illustrating the generic inner_product algorithm with predicate
	14.1.5.	Illustrating the generic adjacent_difference algorithm
	14.1.6.	Illustrating the generic partial_sum algorithm
	14.1.7.	Use the generic partition algorithms: Partition array1, putting numbers greater than 4 first, followed by those less than or equal to 4
	14.1.8.	Using function templates to get the max and min value in an array

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.