Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Find minimum difference between any two elements

  • Difficulty Level : Basic
  • Last Updated : 21 Jan, 2022

Given an unsorted array, find the minimum difference between any pair in given array.
Examples :

Input  : {1, 5, 3, 19, 18, 25};
Output : 1
Minimum difference is between 18 and 19

Input  : {30, 5, 20, 9};
Output : 4
Minimum difference is between 5 and 9

Input  : {1, 19, -4, 31, 38, 25, 100};
Output : 5
Minimum difference is between 1 and -4

 

Method 1 (Simple: O(n2) 
A simple solution is to use two loops. 
 

C++




// C++ implementation of simple method to find
// minimum difference between any pair
#include <bits/stdc++.h>
using namespace std;
 
// Returns minimum difference between any pair
int findMinDiff(int arr[], int n)
{
// Initialize difference as infinite
int diff = INT_MAX;
 
// Find the min diff by comparing difference
// of all possible pairs in given array
for (int i=0; i<n-1; i++)
    for (int j=i+1; j<n; j++)
        if (abs(arr[i] - arr[j]) < diff)
                diff = abs(arr[i] - arr[j]);
 
// Return min diff
return diff;
}
 
// Driver code
int main()
{
int arr[] = {1, 5, 3, 19, 18, 25};
int n = sizeof(arr)/sizeof(arr[0]);
cout << "Minimum difference is " << findMinDiff(arr, n);
return 0;
}
Java



// Java implementation of simple method to find
// minimum difference between any pair
 
class GFG
{
    // Returns minimum difference between any pair
    static int findMinDiff(int[] arr, int n)
    {
        // Initialize difference as infinite
        int diff = Integer.MAX_VALUE;
     
        // Find the min diff by comparing difference
        // of all possible pairs in given array
        for (int i=0; i<n-1; i++)
            for (int j=i+1; j<n; j++)
                if (Math.abs((arr[i] - arr[j]) )< diff)
                    diff = Math.abs((arr[i] - arr[j]));
     
        // Return min diff   
        return diff;
    }
 
    // Driver method to test the above function
    public static void main(String[] args)
    {
        int arr[] = new int[]{1, 5, 3, 19, 18, 25};
        System.out.println("Minimum difference is "+
                              findMinDiff(arr, arr.length));
     
    }
}
Python3



# Python implementation of simple method to find
# minimum difference between any pair
 
# Returns minimum difference between any pair
def findMinDiff(arr, n):
    # Initialize difference as infinite
    diff = 10**20
     
    # Find the min diff by comparing difference
    # of all possible pairs in given array
    for i in range(n-1):
        for j in range(i+1,n):
            if abs(arr[i]-arr[j]) < diff:
                diff = abs(arr[i] - arr[j])
 
    # Return min diff
    return diff
 
# Driver code
arr = [1, 5, 3, 19, 18, 25]
n = len(arr)
print("Minimum difference is " + str(findMinDiff(arr, n)))
 
# This code is contributed by Pratik Chhajer
C#



// C# implementation of simple method to find
// minimum difference between any pair
using System;
 
class GFG {
     
    // Returns minimum difference between any pair
    static int findMinDiff(int []arr, int n)
    {
         
        // Initialize difference as infinite
        int diff = int.MaxValue;
     
        // Find the min diff by comparing difference
        // of all possible pairs in given array
        for (int i = 0; i < n-1; i++)
            for (int j = i+1; j < n; j++)
                if (Math.Abs((arr[i] - arr[j]) ) < diff)
                    diff = Math.Abs((arr[i] - arr[j]));
     
        // Return min diff
        return diff;
    }
 
    // Driver method to test the above function
    public static void Main()
    {
        int []arr = new int[]{1, 5, 3, 19, 18, 25};
        Console.Write("Minimum difference is " +
                        findMinDiff(arr, arr.Length));
    }
}
 
// This code is contributed by nitin mittal.
PHP



<?php
// PHP implementation of simple
// method to find minimum
// difference between any pair
 
// Returns minimum difference
// between any pair
function findMinDiff($arr, $n)
{
// Initialize difference
// as infinite
$diff = PHP_INT_MAX;
 
// Find the min diff by comparing
// difference of all possible
// pairs in given array
for ($i = 0; $i < $n - 1; $i++)
    for ($j = $i + 1; $j < $n; $j++)
        if (abs($arr[$i] - $arr[$j]) < $diff)
                $diff = abs($arr[$i] - $arr[$j]);
 
// Return min diff
return $diff;
}
 
// Driver code
$arr = array(1, 5, 3, 19, 18, 25);
$n = sizeof($arr);
echo "Minimum difference is " ,
         findMinDiff($arr, $n);
 
// This code is contributed by ajit
?>
Javascript



<script>
 
// JavaScript program implementation of simple method to find
// minimum difference between any pair
 
    // Returns minimum difference between any pair
    function findMinDiff( arr, n)
    {
        // Initialize difference as infinite
        let diff = Number.MAX_VALUE;
       
        // Find the min diff by comparing difference
        // of all possible pairs in given array
        for (let i=0; i<n-1; i++)
            for (let j=i+1; j<n; j++)
                if (Math.abs((arr[i] - arr[j]) )< diff)
                    diff = Math.abs((arr[i] - arr[j]));
       
        // Return min diff   
        return diff;
    }
 
// Driver Code
 
        let arr = [1, 5, 3, 19, 18, 25];
        document.write("Minimum difference is "+
                              findMinDiff(arr, arr.length));
 
</script>
Output :
Minimum difference is 1
  
Method 2 (Efficient: O(n Log n) 
The idea is to use sorting. Below are steps. 
1) Sort array in ascending order. This step takes O(n Log n) time. 
2) Initialize difference as infinite. This step takes O(1) time. 
3) Compare all adjacent pairs in sorted array and keep track of minimum difference. This step takes O(n) time.
Below is implementation of above idea.
 
C++



// C++ program to find minimum difference between
// any pair in an unsorted array
#include <bits/stdc++.h>
using namespace std;
 
// Returns minimum difference between any pair
int findMinDiff(int arr[], int n)
{
   // Sort array in non-decreasing order
   sort(arr, arr+n);
 
   // Initialize difference as infinite
   int diff = INT_MAX;
 
   // Find the min diff by comparing adjacent
   // pairs in sorted array
   for (int i=0; i<n-1; i++)
      if (arr[i+1] - arr[i] < diff)
          diff = arr[i+1] - arr[i];
 
   // Return min diff
   return diff;
}
 
// Driver code
int main()
{
   int arr[] = {1, 5, 3, 19, 18, 25};
   int n = sizeof(arr)/sizeof(arr[0]);
   cout << "Minimum difference is " << findMinDiff(arr, n);
   return 0;
}
Java



// Java program to find minimum difference between
// any pair in an unsorted array
 
import java.util.Arrays;
 
class GFG
{
    // Returns minimum difference between any pair
    static int findMinDiff(int[] arr, int n)
    {
           // Sort array in non-decreasing order
           Arrays.sort(arr);
          
           // Initialize difference as infinite
           int diff = Integer.MAX_VALUE;
          
           // Find the min diff by comparing adjacent
           // pairs in sorted array
           for (int i=0; i<n-1; i++)
              if (arr[i+1] - arr[i] < diff)
                  diff = arr[i+1] - arr[i];
          
           // Return min diff
           return diff;
    }
 
    // Driver method to test the above function
    public static void main(String[] args)
    {
        int arr[] = new int[]{1, 5, 3, 19, 18, 25};
        System.out.println("Minimum difference is "+
                              findMinDiff(arr, arr.length));
     
    }
}
Python3



# Python program to find minimum difference between
# any pair in an unsorted array
 
# Returns minimum difference between any pair
def findMinDiff(arr, n):
 
    # Sort array in non-decreasing order
    arr = sorted(arr)
 
    # Initialize difference as infinite
    diff = 10**20
 
    # Find the min diff by comparing adjacent
    # pairs in sorted array
    for i in range(n-1):
        if arr[i+1] - arr[i] < diff:
            diff = arr[i+1] - arr[i]
 
    # Return min diff
    return diff
 
# Driver code
arr = [1, 5, 3, 19, 18, 25]
n = len(arr)
print("Minimum difference is " + str(findMinDiff(arr, n)))
 
# This code is contributed by Pratik Chhajer
C#



// C# program to find minimum
// difference between any pair
// in an unsorted array
using System;
 
class GFG
{
    // Returns minimum difference
    // between any pair
    static int findMinDiff(int[] arr,
                           int n)
    {
        // Sort array in
        // non-decreasing order
        Array.Sort(arr);
         
        // Initialize difference
        // as infinite
        int diff = int.MaxValue;
         
        // Find the min diff by
        // comparing adjacent pairs
        // in sorted array
        for (int i = 0; i < n - 1; i++)
            if (arr[i + 1] - arr[i] < diff)
                diff = arr[i + 1] - arr[i];
         
        // Return min diff
        return diff;
    }
 
    // Driver Code
    public static void Main()
    {
        int []arr = new int[]{1, 5, 3, 19, 18, 25};
        Console.WriteLine("Minimum difference is " +
                           findMinDiff(arr, arr.Length));
     
    }
}
 
//This code is contributed by anuj_67.
PHP



<?php
// PHP program to find minimum
// difference between any pair
// in an unsorted array
 
// Returns minimum difference
// between any pair
function findMinDiff($arr, $n)
{
     
// Sort array in
// non-decreasing order
sort($arr);
 
// Initialize difference
// as infinite
$diff = PHP_INT_MAX;
 
// Find the min diff by
// comparing adjacent
// pairs in sorted array
for ($i = 0; $i < $n - 1; $i++)
    if ($arr[$i + 1] - $arr[$i] < $diff)
        $diff = $arr[$i + 1] - $arr[$i];
 
// Return min diff
return $diff;
}
 
// Driver code
$arr = array(1, 5, 3, 19, 18, 25);
$n = sizeof($arr);
echo "Minimum difference is " ,
         findMinDiff($arr, $n);
 
// This code is contributed ajit
?>
Javascript



<script>
 
    // Javascript program to find minimum
    // difference between any pair
    // in an unsorted array
     
    // Returns minimum difference
    // between any pair
    function findMinDiff(arr, n)
    {
        // Sort array in
        // non-decreasing order
        arr.sort(function(a, b)
        {return a - b});
          
        // Initialize difference
        // as infinite
        let diff = Number.MAX_VALUE;
          
        // Find the min diff by
        // comparing adjacent pairs
        // in sorted array
        for (let i = 0; i < n - 1; i++)
            if (arr[i + 1] - arr[i] < diff)
                diff = arr[i + 1] - arr[i];
          
        // Return min diff
        return diff;
    }
     
    let arr = [1, 5, 3, 19, 18, 25];
    document.write("Minimum difference is "
    + findMinDiff(arr, arr.length));
     
</script>
Output : 
Minimum difference is 1
 
 
Asked in: Amazon
This article is contributed by Harshit Agrawal. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Previous
Size of The Subarray With Maximum Sum
Next

Space optimization using bit manipulations
Recommended Articles
Page :
Find minimum difference between any two elements | Set 2
12, Jun 19
Find set of m-elements with difference of any two elements is divisible by k
20, Feb 18
Minimum distance between any two equal elements in an Array
05, Apr 20
Remove Minimum coins such that absolute difference between any two piles is less than K
10, Jul 19
Minimum difference between any two primes from the given range
04, Nov 19
Place the prisoners into cells to maximize the minimum difference between any two
13, Dec 19
Minimum difference between any two weighted nodes in Sum Tree of the given Tree
27, May 20
Smallest number that can replace all -1s in an array such that maximum absolute difference between any pair of adjacent elements is minimum
28, Jun 21
Maximize the minimum difference between any element pair by selecting K elements from given Array
15, Sep 21
Find last two remaining elements after removing median of any 3 consecutive elements repeatedly
09, Jan 20
Program to find the maximum difference between the index of any two different numbers
09, Apr 19
Minimum Bitwise AND operations to make any two array elements equal
30, Oct 18
Minimum Bitwise OR operations to make any two array elements equal
12, Jul 19
Minimum Bitwise XOR operations to make any two array elements equal
23, Jul 19
Kth smallest number in array formed by product of any two elements from two arrays
21, Oct 21
Reduce sum of any subset of an array to 1 by multiplying all its elements by any value
25, Feb 21
Maximize Array sum by replacing any K elements by its modulo with any positive integer
12, Jan 22
Make all elements zero by decreasing any two elements by one at a time
08, Jan 20
Smallest number having only 4 divisors with difference between any two at most D
26, Jan 22
Count of numbers upto N having absolute difference of at most K between any two adjacent digits
14, Jul 20
Longest subarray with difference exactly K between any two distinct values
13, Jul 20
Longest subarray in which absolute difference between any two element is not greater than X
06, May 20
Minimum count of array elements that must be changed such that difference between maximum and minimum array element is N - 1
27, Sep 21
Minimize the maximum difference of any pair by doubling odd elements and reducing even elements by half
20, Dec 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!