> For the complete documentation index, see [llms.txt](https://shuati.gitbook.io/crack-lintcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://shuati.gitbook.io/crack-lintcode/linkedin/smallest-difference-pair-of-values-between-two-unsorted-arrays.md).

# Smallest Difference pair of values between two unsorted Arrays

Given two arrays of integers, compute the pair of values (one value in each array) with the smallest (non-negative) difference. Return the difference.

**Examples :**

```
Input : A[] = {l, 3, 15, 11, 2}
        B[] = {23, 127, 235, 19, 8} 
Output : 3  
That is, the pair (11, 8) 

Input : A[] = {l0, 5, 40}
        B[] = {50, 90, 80} 
Output : 10
That is, the pair (40, 50)
```

This algorithm takes O(m log m + n log n) time to sort and O(m + n) time to find the minimum difference. Therefore, the overall runtime is O(m log m + n log n).

```java
static int findSmallestDifference(int A[], int B[], 
                                      int m, int n) 
    { 
        // Sort both arrays  
        // using sort function 
        Arrays.sort(A); 
        Arrays.sort(B); 
      
        int a = 0, b = 0; 
      
        // Initialize result as max value 
        int result = Integer.MAX_VALUE; 
      
        // Scan Both Arrays upto  
        // sizeof of the Arrays 
        while (a < m && b < n) 
        { 
            if (Math.abs(A[a] - B[b]) < result) 
                result = Math.abs(A[a] - B[b]); 
      
            // Move Smaller Value 
            if (A[a] < B[b]) 
                a++; 
      
            else
                b++; 
        } 
          
        // return final sma result 
        return result;  
    } 
      
```