基于visual Studio2013解决算法导论之017查找第n小元素

最新推荐文章于 2022-07-05 17:01:04 发布

尹成

最新推荐文章于 2022-07-05 17:01:04 发布

阅读量1.9k

点赞数

分类专栏： VC++编程技术

本文链接：https://blog.csdn.net/itcastcpp/article/details/18410313

版权

VC++编程技术专栏收录该内容

780 篇文章

订阅专栏

题目

查找第n小元素

解决代码及点评

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <time.h>

void PrintArr(int *pnArr, int nLen)
{
	for (int i = 0; i < nLen; i++)
	{
		printf("%d ", pnArr[i]);
	}
	printf("\n");
}

void Swap(int *p1, int *p2)
{
	int nTmp = *p1;
	*p1 = *p2;
	*p2 = nTmp;
}

int Partition(int *pnArr, int nLeft, int nRight)
{
	int nKey = nRight;
	int i = nLeft - 1;
	for (int j = nLeft; j < nRight; j++)
	{
		if (pnArr[j] <= pnArr[nKey])
		{
			i++;
			Swap(&pnArr[i], &pnArr[j]);
		}
	}

	Swap(&pnArr[i+1], &pnArr[nKey]);
	return i+1;
}

int RandomPartiton(int *pnArr, int nLeft, int nRight)
{
	srand(time(NULL));
	int i = rand()%(nRight - nLeft + 1) + nLeft;
	Swap(&pnArr[i], &pnArr[nRight]);

	return Partition(pnArr, nLeft, nRight);
}
//i  第i小元素
int RandomSelect(int *pnArr, int nLeft, int nRight, int i)
{
	if (nLeft == nRight)
	{
		return pnArr[nLeft];
	}
	//寻找一个nTmpPos下标，nTmpPos左边的值都小于它，右边的值都大于它
	int nTmpPos = RandomPartiton(pnArr, nLeft, nRight);

	int nLCount = nTmpPos - nLeft + 1;
	if (nLCount == i)
	{
		return pnArr[nTmpPos];
	}
	else if (i  < nLCount)
	{
		return RandomSelect(pnArr, nLeft, nTmpPos - 1, i);
	}
	else
	{
		return RandomSelect(pnArr, nTmpPos + 1, nRight, i - nLCount);
	}
}

int main()
{
	int nArr[10] = {0,2,1,3,5,6,9,7,4,12}; 

	PrintArr(nArr, 10);
	printf("第5最小元素的值为%d\n", RandomSelect(nArr, 0, 9, 5));
	system("pause");
	return 0;
}