Median Of Two Sorted Arrays

var findKth = function(nums1, nums2, k) {
if (nums1.length > nums2.length) {
return findKth(nums2, nums1, k);
}
if (nums1.length < 1) {
return nums2[k - 1];
}
if (k <= 1) {
return Math.min(nums1[0], nums2[0]);
}

var p1 = Math.min(Math.floor(k / 2), nums1.length),
p2 = k - p1;

if (nums1[p1 - 1] < nums2[p2 - 1]) {
return findKth(nums1.slice(p1), nums2.slice(0, p2), k - p1);
} else if (nums1[p1 - 1] > nums2[p2 - 1]) {
return findKth(nums1.slice(0, p1), nums2.slice(p2), k - p2)
} else {
return nums1[p1 - 1];
}
};

var findMedianSortedArrays = function(nums1, nums2) {
var len = nums1.length + nums2.length;
if (len & 0x1) {
return findKth(nums1, nums2, Math.ceil(len / 2));
} else {
return (findKth(nums1, nums2, Math.floor(len / 2))
+ findKth(nums1, nums2, Math.floor(len / 2) + 1)) / 2;
}
};

var a = [1, 2],
b = [1, 1];
console.log(findMedianSortedArrays(a, b));