// Median of Two Sorted Arrays — HARD

// Category: binary-search

Given two sorted arrays `nums1` and `nums2`, return the median of the two sorted arrays. The overall run time complexity must be O(log(m + n)).

Hint: Binary search on the smaller array. Find a partition such that all elements on the left of the combined arrays are ≤ all elements on the right. The median is the average of the max-left and min-right elements.

Example: nums1 = [1, 3], nums2 = [2]

Output: 2.00000