Merge two array like in merge sort(no need to store result.). until you fetch (|A|+|B|) /2 items last item is median

Using a binary search at array A while change the position index at b. The average running time is log(min(m, n)), where m and n are the respective array size.