Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
Overall run time complexity should be O(log (m+n)).
Input: nums1 = [1,3], nums2 = [2]
Output: 2.0
Input: nums1 = [1,2], nums2 = [3,4]
Output: 2.5
This runner executes a single test per run. Provide two JSON arrays on separate lines as stdin (example: [1,3] newline [2]). Program must print the median.
No submissions yet.
Talk about binary-search partitioning solution, edge cases, precision, and complexity analysis.
