二分查找

int iArraMax[10] = {2, 10,70,163,254,346,438, 726, 817,11};
int iBegain = 0;
int iEnd = 9;
int iMedium = iBegain + (iEnd-iBegain)/2;

int  iMaxV = -4;
while (iMedium >0 && iMedium <iEnd)
{
if (iArraMax[iMedium] >iArraMax[iMedium-1] &&
iArraMax[iMedium] >iArraMax[iMedium+1])
{
iMaxV = iArraMax[iMedium];
break;
}else if (iArraMax[iMedium] < iArraMax[iMedium+1])
{
iBegain = iMedium;
iMedium = iBegain + (iEnd - iBegain)/2;
}else{
iEnd = iMedium;
iMedium = iBegain +(iEnd - iBegain)/2;
}
}

int iSize = 10;
int iPosIndex = 1;
int iMaxValue = iArraMax[0];
int iTempIndex = 0;
while (iSize)
{
if (iArraMax[iPosIndex] > iMaxValue )
{
iMaxValue = iArraMax[iPosIndex];
iTempIndex = iPosIndex;
}
iPosIndex++;
iSize--;
}