64,676
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
using namespace std;
int main()
{
int mid(int num[], int num, int length);
//int count(int num[], int length);
int seq[14] = {1,5,5,5,7,7,7,7,8,8,8,8,8,8};
cout << mid(seq, 5, 14) << endl;
return 0;
}
int mid(int num[], int tar, int length)
{
int midNum = length/2;
if(tar > num[mid-1])
{
mid(num+midNum, tar, length-midNum+1);
}
else if(tar < num[mid-1])
{
mid(num, tar, midNum-1);
}
else
{
return mid;
}
return mid;
}