Standard C++ Library Class Reference

binary_op (*(first + (i - result)), *(first + (i - result) - 1))

result is assigned the value of *first.

adjacent_difference returns result + (last - first).

result can be equal to first. This allows you to place the results of applying adjacent_difference into the original sequence.

Complexity

This algorithm performs exactly (last-first) - 1 applications of the default operation (-) or binary_op.

Example

// adj_diff.cpp

#include<numeric> //For adjacent_difference

#include<vector> //For vector

#include<functional> //For times

#include <iostream.h>

int main()

{

//Initialize a vector of ints from an array

int arr[10] = {1,1,2,3,5,8,13,21,34,55};

vector<int> v(arr,arr+10);

//Two uninitialized vectors for storing results

vector<int> diffs(10), prods(10);

//Calculate difference(s) using default operator (minus)

adjacent_difference(v.begin(),v.end(),diffs.begin());

//Calculate difference(s) using the times operator

adjacent_difference(v.begin(), v.end(), prods.begin(),

times<int>());

//Output the results

cout << "For the vector: " << endl << " ";

copy(v.begin(),v.end(),ostream_iterator<int>(cout," "));

cout << endl << endl; cout << "The differences between adjacent elements are: "

<< endl << " ";

copy(diffs.begin(),diffs.end(),

ostream_iterator<int>(cout," "));

cout << endl << endl; cout << "The products of adjacent elements are: "

<< endl << " ";

copy(prods.begin(),prods.end(),

ostream_iterator<int>(cout," ")); cout << endl;

return 0;

Ouput :

For the vector:

1 1 2 3 5 8 13 21 34 55