Leetcode 4. Median of Two Sorted Arrays

Find the median of two sorted arrays in O(log(m+n)) time by using binary search to partition the arrays so the left half contains the correct count of smaller elements and all left elements ≤ all right elements. The challenge is doing this efficiently without merging and handling unequal lengths and edge boundaries.