Algorithm

In a sorted array, the smallest absolute difference between any two elements will always be between two adjacent elements.Therefore, instead of comparing every possible pair , we can sort the array first, and then just compare each element with its adjacent elements.

Sort the array in increasing order and initialize a variable to store minimum difference with a very large number.
Loop through the array and compute the absolute difference between each adjacent pair.
Keep updating the minimum difference whenever a smaller value is found.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find the minimum difference between any two elements
    int minimumDifference(vector<int>& nums) {
        
        // Sort the array
        sort(nums.begin(), nums.end());

        // Initialize answer with a large number
        int minDiff = INT_MAX;

        // Loop through adjacent pairs
        for (int i = 1; i < nums.size(); i++) {
            
            // Calculate absolute difference
            int diff = nums[i] - nums[i - 1];
            
            // Update minimum difference
            minDiff = min(minDiff, diff);
        }

        // Return the final answer
        return minDiff;
    }
};

int main() {