Maximum absolute difference in an array
Given an array arr[] of N integers, the task is to find the maximum absolute difference between any two elements of the array.
Examples:
Input: arr[] = {2, 1, 5, 3}
Output: 4
|5 – 1| = 4Input: arr[] = {-10, 4, -9, -5}
Output: 14
Approach: The maximum absolute difference in the array will always be the absolute difference between the minimum and the maximum element from the array.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the maximum // absolute difference between // any two elements of the array int maxAbsDiff(int arr[], int n) { // To store the minimum and the maximum // elements from the array int minEle = arr[0]; int maxEle = arr[0]; for (int i = 1; i < n; i++) { minEle = min(minEle, arr[i]); maxEle = max(maxEle, arr[i]); } return (maxEle - minEle); } // Driver code int main() { int arr[] = { 2, 1, 5, 3 }; int n = sizeof(arr) / sizeof(arr[0]); cout << maxAbsDiff(arr, n); return 0; } |
Java
// Java implementation of the approach class GFG { // Function to return the maximum // absolute difference between // any two elements of the array static int maxAbsDiff(int arr[], int n) { // To store the minimum and the maximum // elements from the array int minEle = arr[0]; int maxEle = arr[0]; for (int i = 1; i < n; i++) { minEle = Math.min(minEle, arr[i]); maxEle = Math.max(maxEle, arr[i]); } return (maxEle - minEle); } // Driver code public static void main(String[] args) { int[] arr = { 2, 1, 5, 3 }; int n = arr.length; System.out.print(maxAbsDiff(arr, n)); } } |
Python3
# Python3 implementation of the approach # Function to return the maximum # absolute difference between # any two elements of the array def maxAbsDiff(arr, n): # To store the minimum and the maximum # elements from the array minEle = arr[0] maxEle = arr[0] for i in range(1, n): minEle = min(minEle, arr[i]) maxEle = max(maxEle, arr[i]) return (maxEle - minEle) # Driver code arr = [2, 1, 5, 3] n = len(arr) print(maxAbsDiff(arr, n)) # This code is contributed # by mohit kumar |
C#
// C# implementation of the approach using System; class GFG { // Function to return the maximum // absolute difference between // any two elements of the array static int maxAbsDiff(int []arr, int n) { // To store the minimum and the maximum // elements from the array int minEle = arr[0]; int maxEle = arr[0]; for (int i = 1; i < n; i++) { minEle = Math.Min(minEle, arr[i]); maxEle = Math.Max(maxEle, arr[i]); } return (maxEle - minEle); } // Driver code public static void Main() { int[] arr = { 2, 1, 5, 3 }; int n = arr.Length; Console.WriteLine(maxAbsDiff(arr, n)); } } // This code is contributed by Ryuga |
PHP
Output:
4
Recommended Posts:
- Maximum sum of absolute difference of an array
- Count maximum elements of an array whose absolute difference does not exceed K
- Maximum absolute difference between sum of two contiguous sub-arrays
- Maximum absolute difference of value and index sums
- Find maximum number of elements such that their absolute difference is less than or equal to 1
- Triplets in array with absolute difference less than k
- Sort an array according to absolute difference with given value
- Sort an array according to absolute difference with given value using Functors
- k-th smallest absolute difference of two elements in an array
- Sum of minimum absolute difference of each array element
- Count pairs in an array such that the absolute difference between them is ≥ K
- Absolute Difference of even and odd indexed elements in an Array
- Python | Sort an array according to absolute difference
- Absolute Difference of all pairwise consecutive elements in an array
- Check if array can be divided into two sub-arrays such that their absolute difference is K
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.



