基于visual Studio2013解决算法导论之008快速排序算法

来源：互联网发布：nginx 子域名配置编辑：程序博客网时间：2024/05/14 20:41

题目

快速排序

解决代码及点评

#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;}//实现对子数组[nLeft - nRight]的原址重排，将主元素放到合适位置//递增排序int Patition1(int *pnArr, int nLeft, int nRight){int nKey = pnArr[nRight];int i = nLeft - 1;for (int j = nLeft; j < nRight; j++){if (pnArr[j] <= nKey){i++;Swap(&pnArr[i], &pnArr[j]);}}//将主元素插入到中间位置Swap(&pnArr[i+1], &pnArr[nRight]);return i+1;}//递增排序int Patition2(int *pnArr, int nLeft, int nRight){int nKey = nRight;int i = nLeft - 1;bool bExchange = false;for (int j = nLeft; j < nRight; j++){if (pnArr[j] < pnArr[nKey]){i++;Swap(&pnArr[i], &pnArr[j]);bExchange = true;}}Swap(&pnArr[i+1],&pnArr[nRight]);if (bExchange){return i+1;}else{return (nLeft + nRight) / 2;}}//递减排序int Patition3(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;}//寻找一个nTmpPos下标，nTmpPos左边的值都小于它，右边的值都大于它void QuickSort(int *pnArr, int nLeft, int nRight){if (nLeft < nRight){//分解int nTmpPos = Patition3(pnArr, nLeft, nRight);//解决/合并QuickSort(pnArr, nLeft, nTmpPos - 1);QuickSort(pnArr, nTmpPos + 1, 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;}

代码下载及其运行

代码下载地址：http://download.csdn.net/detail/yincheng01/6858815

解压密码：c.itcast.cn

下载代码并解压后，用VC2013打开interview.sln，并设置对应的启动项目后，点击运行即可，具体步骤如下：

1）设置启动项目：右键点击解决方案，在弹出菜单中选择“设置启动项目”

2）在下拉框中选择相应项目，项目名和博客编号一致

3）点击“本地Windows调试器”运行

程序运行结果

0 0