Algorithms Problem - sorted arrays?

binary search both would give you O(Log n + log m). Then a simple "who's bigger" comparison between the two (zero on O scale) will give you the answer.