Absolute Difference of all pairwise consecutive elements in an array
Last Updated :
07 Jan, 2024
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
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++
#include <iostream>
using namespace std;
void pairwiseDifference( int arr[], int n)
{
int diff;
for ( int i = 0; i < n - 1; i++) {
diff = abs (arr[i] - arr[i + 1]);
cout << diff << " " ;
}
}
int main()
{
int arr[] = { 4, 10, 15, 5, 6 };
int n = sizeof (arr) / sizeof (arr[0]);
pairwiseDifference(arr, n);
return 0;
}
|
C
#include <stdio.h>
int abs ( int a)
{
int abs = a;
if ( abs < 0)
abs = abs * (-1);
return abs ;
}
void pairwiseDifference( int arr[], int n)
{
int diff;
for ( int i = 0; i < n - 1; i++) {
diff = abs (arr[i] - arr[i + 1]);
printf ( "%d " ,diff);
}
}
int main()
{
int arr[] = { 4, 10, 15, 5, 6 };
int n = sizeof (arr) / sizeof (arr[0]);
pairwiseDifference(arr, n);
return 0;
}
|
Java
class GFG{
static void pairwiseDifference( int arr[], int n)
{
int diff;
for ( int i = 0 ; i < n - 1 ; i++) {
diff = Math.abs(arr[i] - arr[i + 1 ]);
System.out.print(diff+ " " );
}
}
public static void main(String[] args)
{
int arr[] = { 4 , 10 , 15 , 5 , 6 };
int n = arr.length;
pairwiseDifference(arr, n);
}
}
|
Python 3
def pairwiseDifference(arr, n):
for i in range (n - 1 ) :
diff = abs (arr[i] - arr[i + 1 ])
print (diff , end = " " )
if __name__ = = "__main__" :
arr = [ 4 , 10 , 15 , 5 , 6 ]
n = len (arr)
pairwiseDifference(arr, n)
|
C#
using System;
class GFG{
static void pairwiseDifference( int []arr, int n)
{
int diff;
for ( int i = 0; i < n - 1; i++) {
diff = Math.Abs(arr[i] - arr[i + 1]);
Console.WriteLine(diff+ " " );
}
}
public static void Main(String[] args)
{
int []arr = { 4, 10, 15, 5, 6 };
int n = arr.Length;
pairwiseDifference(arr, n);
}
}
|
Javascript
<script>
function pairwiseDifference(arr , n) {
var diff;
for (i = 0; i < n - 1; i++) {
diff = Math.abs(arr[i] - arr[i + 1]);
document.write(diff + " " );
}
}
var arr = [ 4, 10, 15, 5, 6 ];
var n = arr.length;
pairwiseDifference(arr, n);
</script>
|
PHP
<?php
function pairwiseDifference( $arr , $n )
{
$diff = 0;
for ( $i = 0; $i < $n - 1; $i ++)
{
$diff = abs ( $arr [ $i ] - $arr [ $i + 1]);
echo $diff . " " ;
}
}
$arr = array ( 4, 10, 15, 5, 6 );
$n = sizeof( $arr );
pairwiseDifference( $arr , $n );
?>
|
Complexity Analysis:
- Time complexity: O(n),
- Auxiliary Space: O(1)
Share your thoughts in the comments
Please Login to comment...