LeetCode - 4 - Median of Two Sorted Arrays

 /**

 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number}
 */
var findMedianSortedArrays = function(nums1, nums2) {
    const l1 = nums1.length, l2 = nums2.length;
    const midIndex = Math.floor((l1 + l2) / 2);
    if ((l1 + l2) % 2 == 1) {
        console.log(midIndex);
        return findKthElement(nums1, nums2, midIndex, 0, l1 - 1 , 0, l2 - 1);
    } else {
        const midFirst = findKthElement(nums1, nums2, midIndex, 0, l1 - 1 , 0, l2 - 1);
        const midSecond = findKthElement(nums1, nums2, midIndex - 1, 0, l1 - 1 , 0, l2 - 1);
        return (midFirst + midSecond) / 2;
    }
};

function findKthElement(arr1, arr2, k, i1, j1, i2, j2) {
    if (j1 < i1) {
        return arr2[k - i1];
    }
    if (j2 < i2) {
        return arr1[k - i2];
    }
    var indexMid1 = parseInt((i1 + j1) / 2 ) , indexMid2 = parseInt((i2 + j2) / 2);
    var mid1 = arr1[indexMid1], mid2 = arr2[indexMid2];
    if (indexMid1 + indexMid2 < k) {
        if (mid1 > mid2) {
            return findKthElement(arr1, arr2, k, i1, j1, indexMid2 + 1, j2);
        } else {
            return findKthElement(arr1, arr2, k, indexMid1 + 1 , j1, i2 , j2);
        }
    } else {
        if (mid1 > mid2) {
            return findKthElement(arr1, arr2, k, i1 , indexMid1 - 1 , i2 , j2);
        } else {
            return findKthElement(arr1, arr2, k, i1, j1, i2 , indexMid2 - 1);
        }
    }
}