Practice Median of Two Sorted Arrays

Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Practice approach: Binary-search a partition of the shorter array. Choose the other array’s partition so the left side contains floor((m + n + 1) / 2) entries. A partition is valid when each left-side maximum is at most the opposite right-side minimum. Treat a missing left neighbor as negative infinity and a missing right neighbor as positive infinity. If the shorter array’s left value is too large, move its partition left; if its right value is too small, move right. For an odd total, return the larger left value; for an even total, average that value and the smaller right value. For [1, 2] and [3, 4], the valid boundary separates 2 from 3, giving 2.5. An empty input array is handled by the same boundary rules. The search takes O(log(min(m, n) + 1)) steps, with constant work for an empty shorter array, and O(1) auxiliary space.