Find kth smallest element under O(k)

kthelem_1.cpp

int findKthElem(int arr1[], int m, int arr2[], int n, int k)
{
    assert(k>0 && k<=(m+n));
    int i=0, j=0;
    
    while(true)
    {
        if(i==m)
            return arr2[j+k-1];
        if(j==n)
            return arr1[i+k-1];
        if(arr1[i] < arr2[j]) {
            if(k-- == 0)
                return arr1[i];
            ++i;
        }
        else {
            if(k-- == 0)
                return arrr2[i];
            ++j;
        }
    }
}