以O(logn)的时间复杂度计算两个数组的中位数

//数组a[N]和b[N]已排好序，计算a[N]和b[N]这2N个数的中位数

#include <iostream>

using namespace std;

//计算每个数组的中位数
float Median(float a[],int n)
{
if(n%2==0)
return (a[n/2]+a[n/2-1])/2.0f;
else
return a[n/2];
}

/*求共同中位数：a_median=b_median时median=a_median;a_median <b_median时median为a[m]~a[N-1]和b[0]~b[m]的中位数;

a_median>b_median时median为a[0]~a[m]和b[m]~b[N-1]的中位数*/
float Middle(float a[],float b[],int n)
{
if(n==1)
return  (a[0]+b[0])/2.0f;
float a_median=Median(a,n);
float b_median=Median(b,n);
if(a_median==b_median)
return a_median;
else if(a_median <b_median)
if(n%2==0)
return Middle(a+n/2,b,n/2);
else
return Middle(a+n/2,b,n/2+1);
else
if(n%2==0)
return Middle(a,b+n/2,n/2);
else
return Middle(a,b+n/2,n/2+1);
}


int main()
{
const int N=6;
float a[N]={0,1,2,3,4,5};
float b[N]={5,6,7,8,9,10};
cout<<Middle(a,b,N)<<endl;
return 0;
}