Given two sorted arrays
nums2 of size
n respectively, return the median of the two sorted arrays.
The overall run time complexity should be
Input: nums1 = [1,3], nums2 =  Output: 2.00000 Explanation: merged array = [1,2,3] and median is 2.
Input: nums1 = [1,2], nums2 = [3,4] Output: 2.50000 Explanation: merged array = [1,2,3,4] and median is (2 + 3) / 2 = 2.5.
Input: nums1 = [0,0], nums2 = [0,0] Output: 0.00000
Input: nums1 = , nums2 =  Output: 1.00000
Input: nums1 = , nums2 =  Output: 2.00000
nums1.length == m
nums2.length == n
0 <= m <= 1000
0 <= n <= 1000
1 <= m + n <= 2000
-106 <= nums1[i], nums2[i] <= 106
The main gist of this solution is to use Binary search on the shorter size of Array and create partitioning in which both partitions will be having the same number of elements where all elements in the left partition is smaller than all the elements on the right side of the partition.
Time Complexity: O(log(min(m,n)) //Where m and n are the sizes of both the arrays.
Space Complexity: O(1) // We are not using any extra space.