Find the median of two already-sorted arrays nums1 and nums2 without fully merging them. Two approaches — the O(m+n) merge baseline, and the optimal O(log min(m,n)) partition search.
nums1
nums2