# Absolute Difference of all pairwise consecutive elements in an array

Given an array of integers of N elements. The task is to print the absolute difference of all of the pairwise consecutive elements.

Pairwise consecutive pairs of an array of size N are (a[i], a[i+1]) for all i ranging from 0 to N-2

Examples:

```Input: arr[] = {8, 5, 4, 3, 15, 20}
Output: 3, 1, 1, 12, 5

Input: arr[] = {5, 10, 15, 20}
Output: 5, 5, 5
```

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: The solution is to traverse the array and calculate and print the absolute difference of every pair (arr[i], arr[i+1]).

Below is the implementation of the above approach:

 `// C++ program to print the absolute ` `// difference of the consecutive elements ` `#include ` `using` `namespace` `std; ` ` `  `// Function to print pairwise absolute ` `// difference of consecutive elements ` `void` `pairwiseDifference(``int` `arr[], ``int` `n) ` `{ ` `    ``int` `diff; ` `    ``for` `(``int` `i = 0; i < n - 1; i++) { ` ` `  `        ``// absolute difference between ` `        ``// consecutive numbers ` `        ``diff = ``abs``(arr[i] - arr[i + 1]); ` `        ``cout << diff << ``" "``; ` `    ``} ` `} ` ` `  `// Driver Code ` `int` `main() ` `{ ` `    ``int` `arr[] = { 4, 10, 15, 5, 6 }; ` `    ``int` `n = ``sizeof``(arr) / ``sizeof``(arr[0]); ` ` `  `    ``pairwiseDifference(arr, n); ` ` `  `    ``return` `0; ` `} `

 `// Java program to print the absolute  ` `// difference of the consecutive elements  ` ` `  `class` `GFG{ ` `// Function to print pairwise absolute  ` `// difference of consecutive elements  ` `static` `void` `pairwiseDifference(``int` `arr[], ``int` `n)  ` `{  ` `    ``int` `diff;  ` `    ``for` `(``int` `i = ``0``; i < n - ``1``; i++) {  ` ` `  `        ``// absolute difference between  ` `        ``// consecutive numbers  ` `        ``diff = Math.abs(arr[i] - arr[i + ``1``]);  ` `        ``System.out.print(diff+``" "``);  ` `    ``}  ` `}  ` ` `  `// Driver Code  ` `public` `static` `void` `main(String[] args)  ` `{  ` `    ``int` `arr[] = { ``4``, ``10``, ``15``, ``5``, ``6` `};  ` `    ``int` `n = arr.length;  ` ` `  `    ``pairwiseDifference(arr, n);  ` `}  ` `} ` `// This code is contributed by mits `

 `# Python 3 program to print the absolute ` `# difference of the consecutive elements ` ` `  `# Function to print pairwise absolute ` `# difference of consecutive elements ` `def` `pairwiseDifference(arr, n): ` `     `  `    ``for` `i ``in` `range``(n ``-` `1``) : ` ` `  `        ``# absolute difference between ` `        ``# consecutive numbers ` `        ``diff ``=` `abs``(arr[i] ``-` `arr[i ``+` `1``]) ` `        ``print``(diff , end ``=` `" "``) ` ` `  `# Driver Code ` `if` `__name__``=``=``"__main__"``: ` `    ``arr ``=` `[ ``4``, ``10``, ``15``, ``5``, ``6` `] ` `    ``n ``=` `len``(arr) ` ` `  `    ``pairwiseDifference(arr, n) ` ` `  `# This code is contributed  ` `# by ChitraNayal `

 `// C# program to print the absolute  ` `// difference of the consecutive elements  ` `using` `System; ` ` `  `class` `GFG{ ` `// Function to print pairwise absolute  ` `// difference of consecutive elements  ` `static` `void` `pairwiseDifference(``int` `[]arr, ``int` `n)  ` `{  ` `    ``int` `diff;  ` `    ``for` `(``int` `i = 0; i < n - 1; i++) {  ` ` `  `        ``// absolute difference between  ` `        ``// consecutive numbers  ` `        ``diff = Math.Abs(arr[i] - arr[i + 1]);  ` `        ``Console.WriteLine(diff+``" "``);  ` `    ``}  ` `}  ` ` `  `// Driver Code  ` `public` `static` `void` `Main(String[] args)  ` `{  ` `    ``int` `[]arr = { 4, 10, 15, 5, 6 };  ` `    ``int` `n = arr.Length;  ` ` `  `    ``pairwiseDifference(arr, n);  ` `}  ` `} `

 ` `

Output:
```6 5 10 1
```

Time complexity : O(n)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Practice Tags :