基于visual Studio2013解决算法导论之010快排中应用插入排序-CSDN博客

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

本文介绍了一种快速排序算法的实现，该算法在处理小规模子数组时采用插入排序进行优化。通过随机选取枢轴元素来提高算法的平均性能表现，并提供了完整的C语言代码示例及运行说明。

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

题目

快排中引用插入排序

解决代码及点评

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

#define K 3
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[nRight]);

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

	return Partition(pnArr, nLeft, nRight);
}

void InsertSort(int *pnArr, int nLeft, int nRight)
{
	for (int i = nLeft + 1; i <= nRight; i++)
	{
		int nTmp = pnArr[i];
		int j;
		for (j = i; j > nLeft && nTmp <pnArr[j-1]; j--)
		{
			pnArr[j] = pnArr[j-1];
		}
		pnArr[j] = nTmp;
	}
}
void QuickSort(int *pnArr, int nLeft, int nRight)
{
	if (nLeft < nRight)
	{
		if (nRight - nLeft > K)
		{
			int nTmpPos = RandomPartition(pnArr, nLeft, nRight);

			QuickSort(pnArr, nLeft, nTmpPos - 1);
			QuickSort(pnArr, nTmpPos + 1, nRight);
		}
		else
		{
			InsertSort(pnArr, nLeft, nRight);
		}

	}
}
int main()
{
	int nArr[10] = {42,1,3,2,16,9,10,14,8,17}; 

	PrintArr(nArr, 10);
	QuickSort(nArr, 0,9);

	PrintArr(nArr, 10);
	system("pause");
	return 0;
}