Find the kth smallest element in two sorted array

The basic thought is as follows

the pseudo code will be as follows

 i <- k/2, j <- k/2
 step <- k/4
 while step > 0
    if a[k/2] > b[k/2]
        i -= step
        j += step
    else
        i += step
        j -= step
    step /= 2

 if a[i] > b[j]
    return a[i]
 else
    return b[j]

 Recursively:

int kth(int *arr1, int *arr2, int *end1, int *end2, int k)
{
    if (arr1 == end1)
        return arr2[k];
    if (arr2 == end2)
        return arr1[k];
    int mid1 = (end1 - arr1) / 2;
    int mid2 = (end2 - arr2) / 2;
    if (mid1 + mid2 < k)
    {
        if (arr1[mid1] > arr2[mid2])
            return kth(arr1, arr2 + mid2 + 1, end1, end2,
                k - mid2 - 1);
        else
            return kth(arr1 + mid1 + 1, arr2, end1, end2,
                k - mid1 - 1);
    }
    else
    {
        if (arr1[mid1] > arr2[mid2])
            return kth(arr1, arr2, arr1 + mid1, end2, k);
        else
            return kth(arr1, arr2, end1, arr2 + mid2, k);
    }
}