﻿Find the median of two sorted arrays nums1 and nums2 in O(log(min(m, n))) time, where m and n are the lengths of the arrays.

Implement the binary search approach that partitions both arrays simultaneously.

Test with:
- nums1 = [1, 3], nums2 = [2] -> median = 2.0
- nums1 = [1, 2], nums2 = [3, 4] -> median = 2.5
- nums1 = [], nums2 = [1] -> median = 1.0
- nums1 = [1, 3, 5, 7, 9], nums2 = [2, 4, 6, 8, 10] -> median = 5.5
