First, ensure that arr1 is the smaller array. If not, swap the arrays. Our goal is to treat arr1[] as the smaller array.
Calculate the length of the left half as left = k.
Initialize two pointers:
- low will point to max(0, k - n2),
- high will point to min(k, n1) (n1 is the size of the smaller array and n2 is the size of the larger array).
Calculate 'mid1' and 'mid2':
- mid1 = (low + high) // 2 (integer division),
- mid2 = left - mid1.
Inside the loop, calculate l1, l2, r1, and r2:
- l1 = arr1[mid1 - 1],
- l2 = arr2[mid2 - 1],
- r1 = arr1[mid1],
- r2 = arr2[mid2].
- If mid1 or mid2 is out of bounds, set l1, l2 to INT_MIN and r1, r2 to INT_MAX.
Eliminate halves based on the following conditions:
- If l1 <= r2 and l2 <= r1, the answer is found. Return the maximum of l1 and l2.
- If l1 > r2, eliminate the right half by setting high = mid1 - 1.
- If l2 > r1, eliminate the left half by setting low = mid1 + 1.
When the loop terminates, include a dummy return statement to avoid warnings or errors.