Given two sorted numerical arrays of potentially different lengths, implement an efficient algorithm to find the median of the combined sorted set without merging them into a new array. The solution should ideally run in logarithmic time relative to the size of the smaller array.