help with function

[ghost1111]

https://www.geeksforgeeks.org/smallest-difference-pair-values-two-unsorted-arrays/
i have to make an assignment similar to this using recursive and vector and i cannot use sort, in this particular assignment.
example:
A = {1, 2, 6}, b = {0, 1, 3, 4, 5}, the output should be diff(a, b) = 2

i done try alot things and im lost and i need help please only give me advice and try not to give me the answer

int diff_with_recrusive(const std::vector<int>& a, const std::vector<int>& b, int m, int n)
{
      int minDiff = INT_MAX; 
      m=a.size();
      n=b.size();
      for(int i=0; i<m; i++) {

       for(int j=0; j<n j++) {

           if(abs(a[i] - b[j]) < minDiff) {
               minDiff = abs(a[i] - b[j]);
           }
       }
   }

   return minDiff;

}
int diff_recursive(const std::vector<int>& a, const std::vector<int>& b)
{
	return diff_with_recrusive(a, b, a.size(), b.size());
}

[VX0726]

Seeing as you are using vectors, I would look into std::sort (...): http://www.cplusplus.com/reference/algorithm/sort/.

Have fun!

VX