題目

快排改良

解決代碼及點評

#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 n1 = rand()%(nRight - nLeft + 1) + nLeft;int n2 = rand()%(nRight - nLeft + 1) + nLeft;int n3 = rand()%(nRight - nLeft + 1) + nLeft;int nKey = (n1+n2+n3) / 3;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; }

代碼下載及其運行

代碼下載地址：http://download.csdn.net/detail/yincheng01/6858815

解壓密碼：c.itcast.cn

下載代碼并解壓后，用VC2013打開interview.sln，并設置對應的啟動項目后，點擊運行即可，具體步驟如下：

1）設置啟動項目：右鍵點擊解決方案，在彈出菜單中選擇“設置啟動項目”

2）在下拉框中選擇相應項目，項目名和博客編號一致

3）點擊“本地Windows調試器”運行

程序運行結果



轉載于:https://www.cnblogs.com/niulanshan/p/6175057.html

總結

以上是生活随笔為你收集整理的基于visual Studio2013解决算法导论之011快排改良的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。