1.代码
#include<iostream>
#include<windows.h>
using namespace std;
int SearchMid(int A[ ], int B[ ], int n);
int main()
{
int A[]={1,2,3,5,7};
int B[]={2,4,6,8,10};
int mid=SearchMid(A,B,5);
cout<<"两个序列的中位数是:"<<mid<<endl;
Sleep(6000);
return 0;
}
int SearchMid(int A[ ], int B[ ], int n)
{
int s1 = 0, e1 = n - 1, s2 = 0, e2 = n-1; //初始化两个序列的上下界
int mid1, mid2;
while (s1 < e1 && s2 < e2) //循环直到区间只有一个元素
{
mid1= (s1 + e1)/2; //序列A的中位数的下标
mid2 = (s2 + e2)/2; //序列B的中位数的下标
if (A[mid1] == B[mid2]) return A[mid1]; //第①种情况
if (A[mid1] < B[mid2]) //第②种情况
{
if ((s1 + e1) % 2 == 0)
s1 = mid1;
else
s1 = mid1 + 1;
e2 = mid2;
}
else
{
if ((s2 + e2) % 2 == 0)
s2 = mid2;
else
s2 = mid2 + 1;
e1 = mid1;
}
}
if (A[s1] < B[s2]) return A[s1]; //较小者为所求
else return B[s2];
}
2.结果示例