The proper way to do is :
a) Implement binary search by a little modification in finding the middle index for both the 2 same sized subarrays..
b) If found , then report the element else continue recursively..
So the time complexity will be O(logm + logm) = O(2logm) = O(logm)
X->YZ , Y->XZ , ...