 Open in App
Not now

• Difficulty Level : Easy
• Last Updated : 01 Feb, 2023

Compute adjacent difference of range Assigns to every element in the range starting at result, the difference between its corresponding element in the range [first, last] and the one preceding it (except for *result, which is assigned *first). If x represents an element in [first, last] and y represents an element in result, the ys can be calculated as:

```y0 = x0
y1 = x1 - x0
y2 = x2 - x1
y3 = x3 - x2
y4 = x4 - x3
and so on.```

1. Using default version : Syntax : Template :

```OutputIterator adjacent_difference (InputIterator first,
InputIteratorlast,
OutputIterator result);
Parameters :

first, last
Input iterators to the initial and final positions in a sequence.
The range used is [first, last], which contains all the elements
between first and last, including the element pointed by first but
not the element pointed by last.

result
Output iterator to the initial position in the destination sequence
where the differences are stored. The range starts at result and
shall have a size large enough to contain as many elements as the
range above [first, last].

Return Type :
An iterator pointing to past the last element of the destination
sequence where resulting elements have been stored.```

## CPP

 `// CPP program to illustrate` `// std :: adjacent_difference`   `#include // std::cout` `#include // std::adjacent_difference`   `int` `comp(``int` `x, ``int` `y)` `{` `    ``return` `x + y;` `}`   `// Driver code` `int` `main()` `{` `    ``int` `val[] = { 1, 2, 3, 5, 9, 11, 12 };` `    ``int` `n = ``sizeof``(val) / ``sizeof``(val);` `    ``int` `result;`   `    ``// Array contains` `    ``std::cout << ``"Array contains :"``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << ``" "` `<< val[i];` `    ``std::cout << ``"\n"``;`   `    ``// std :: adjacent_difference using custom function` `    ``std::adjacent_difference(val, val + 7, result, comp);`   `    ``std::cout << ``"Using custom function: "``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << result[i] << ``' '``;` `    ``std::cout << ``'\n'``;`   `    ``return` `0;` `}`

Output:

```Array contains : 1 2 3 5 9 11 12
Using default adjacent_difference: 1 1 2 4 2 1```

Time Complexity: O(n)

Space Complexity: O(n)

2. Using custom version, taking function as comp Syntax : Template :

```OutputIterator adjacent_difference (InputIterator first,
InputIterator last,
OutputIterator result,
BinaryOperation binary_op);

Parameters :

first, last, result are same as above.

binary_op
Binary operation taking as arguments two elements of the type
pointed by InputIterator, and returning the result of the
replacement for the difference operation.
This can either be a function pointer or a function object.

Return Type :
An iterator pointing to past the last element of the destination
sequence where resulting elements have been stored.```

By changing the operator to any binary operator in the custom function, we can change the operation that is applied on the STL function. Here the sum of adjacent elements is performed.

## CPP

 `// CPP program to illustrate` `// std :: adjacent_difference`   `#include // std::cout` `#include // std::adjacent_difference`   `int` `comp(``int` `x, ``int` `y)` `{` `    ``return` `x + y;` `}`   `// Driver code` `int` `main()` `{` `    ``int` `val[] = { 1, 2, 3, 5, 9, 11, 12 };` `    ``int` `n = ``sizeof``(val) / ``sizeof``(val);` `    ``int` `result;`   `    ``// Array contains` `    ``std::cout << ``"Array contains :"``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << ``" "` `<< val[i];` `    ``std::cout << ``"\n"``;`   `    ``// std :: adjacent_difference using custom function` `    ``std::adjacent_difference(val, val + 7, result, comp);`   `    ``std::cout << ``"Using custom function: "``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << result[i] << ``' '``;` `    ``std::cout << ``'\n'``;`   `    ``return` `0;` `}`

Output:

```Array contains : 1 2 3 5 9 11 12
Using custom function: 1 3 5 8 14 20 23 ```

Time Complexity: O(n)

Space Complexity: O(n)

Practical application : Perform any binary operation between the adjacent elements of the range mentioned (except the first element of the range). 1. Find product of the adjacent elements in the array. For example, array contains : 2 4 5 6 Result is : 2 8 20 30 Explanation – First elements remain as it is. Then second element will be first element * second element, then third element will be second element * third element and so on.

## CPP

 `// CPP program to illustrate` `// std :: adjacent_difference`   `#include // std::cout` `#include // std::adjacent_difference`   `int` `comp(``int` `x, ``int` `y)` `{` `    ``return` `x * y;` `}`   `// Driver code` `int` `main()` `{` `    ``int` `val[] = { 5, 7, 4, 8, 2 };` `    ``int` `n = ``sizeof``(val) / ``sizeof``(val);` `    ``int` `result[n];`   `    ``// Array contains` `    ``std::cout << ``"Array contains :"``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << ``" "` `<< val[i];` `    ``std::cout << ``"\n"``;`   `    ``// Using custom std :: adjacent_difference` `    ``std::adjacent_difference(val, val + 7, result, comp);` `    ``std::cout << ``"Result contains :"``;` `    ``for` `(``int` `i = 0; i < n; i++)` `        ``std::cout << ``' '` `<< result[i];` `    ``std::cout << ``'\n'``;`   `    ``return` `0;` `}`

OUTPUT :

```Array contains : 5 7 4 8 2
Result contains : 5 35 28 32 16```

Time Complexity: O(n)

Space Complexity: O(n)