There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
public class Solution {
public double findMedianSortedArrays(int A[], int B[]) {
int n = A.length;
int m = B.length;
int num = m+n;
int[] ab = new int[n+m];
for(int i=0;i<n;i++)
{
ab[i] = A[i];
}
for(int i=0;i<m;i++)
{
ab[i+n] = B[i];
}
Arrays.sort(ab);
double medain;
if((num)%2!=0)
{
medain = (double)ab[(num+1)/2-1];
}
else
{
medain = (double)(ab[num/2-1]+ab[num/2])/2;
}
return medain;
}
}