Median of Two Sorted Arrays

-----QUESTION-----

There are two sorted arrays A and B of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

-----SOLUTION-----

class Solution {
public:
    double findMedianSortedArrays(int A[], int m, int B[], int n) {
        if(m==0) return n%2==0?(double)(B[n/2-1] + B[n/2])/2: B[n/2];
        else if(n==0) return m%2==0?(double)(A[m/2-1] + A[m/2])/2: A[m/2];
        if((m+n)%2==0) 
        {
            int v1 = findKthElem(A, 0 , m - 1, B, 0 , n - 1, (m+n)/2-1);
            int v2 = findKthElem(A, 0 , m - 1, B, 0 , n - 1, (m+n)/2);
            return (double) (v1+v2)/2;
        }
        else
        {
            return findKthElem(A, 0 , m - 1, B, 0 , n - 1, (m+n)/2);
        }
    }
    int findKthElem(int A[], int startA, int endA, int B[], int startB, int endB, int k){
        if(startA >= endA)
        {
            if(k==0) return min(A[startA], B[startB]);
            else if(startB+k <= endB && B[startB+k]<=A[startA]) return B[startB+k];
            else if(A[startA] < B[startB+k-1]) return B[startB+k-1];
            else return A[startA];
        }
        else if(startB >= endB)
        {
            if(k==0) return min(A[startA], B[startB]);
            else if(startA+k <= endA && A[startA+k]<=B[startB]) return A[startA+k];
            else if(B[startB] < A[startA+k-1]) return A[startA+k-1];
            else return B[startB];
        }
        
        int midA = (startA+endA)>>1;
        int midB = (startB+endB)>>1;
        int len = endA-startA + endB - startB +2;
        if(k
            if(A[midA] < B[midB]) 
            {
                endB = midB;
            }
            else
            {
                endA = midA;
            }
            return findKthElem(A,startA,endA,B,startB, endB, k);
        }
        else
        {
            if(A[midA] < B[midB]) 
            {
                k = k - (midA - startA +1);
                startA = midA+1;

            }
            else
            {
                k = k - (midB - startB +1);
                startB = midB+1;
            }
            return findKthElem(A,startA,endA,B,startB, endB, k);
        }
    }
};