For valid non-empty lists, the merged list should always be correctly sorted in ascending order. This ensures that only correct implementations pass all test cases.

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