There are two sorted arrays A and B of size m and n respectively.Problem Constraints
Find the median of the two sorted arrays ( The median of the array formed by merging both arrays ).
The overall run time complexity should be O(log (m+n)).
NOTE: If the number of elements in the merged array is even, then the median is the average of n / 2 th and n/2 + 1th element. For example, if the array is [1 2 3 4], the median is (2 + 3) / 2.0 = 2.5
0 <= |A| <= 106Input Format
0 <= |B| <= 106
1 <= |A| + |B| <= 2 * 106
The first argument is an integer array A.Output Format
The second argument is an integer array B.
Return a double value equal to the median.Example Input
A : [1 4 5]Example Output
B : [2 3]
Merged A and B will be : [1, 2, 3, 4, 5]
Its median will be 3
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.