find the minimal difference between two sorted arrays elements

find the minimal difference between two sorted arrays elements

	int find_min_diff(vector<int>& A, vector<int>& B) { if(A.empty() || B.empty()) return -1;
	int m = A.size(), n = B.size();
	int i = 0, j = 0;
	int res = -1;
	while(i < m && j < n) {
	int diff = abs(A[i] - B[j]);
	res = min(res, diff);
	if(res == 0) return 0;
	if(A[i] > B[j]) j++;
	else i++;
	}
	return res;
	}

Read full article from find the minimal difference between two sorted arrays elements