Median of Two Sorted Arrays

Binary search on the smaller array to find the partition point where left half elements all <= right half elements in both arrays - handle edge cases with infinity. O(log(min(m,n))) and a brutal problem that tests binary search mastery; understanding the invariant is half the battle.