二分查找

最新推荐文章于 2024-11-13 16:12:06 发布

清缕风

最新推荐文章于 2024-11-13 16:12:06 发布

阅读量340

点赞数

分类专栏： c++

本文链接：https://blog.youkuaiyun.com/u012536286/article/details/47317371

版权

c++ 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种算法用于在给定数组中找到最大值及其索引位置，通过迭代比较数组元素来实现这一目标。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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--;
	}