十年網(wǎng)站開發(fā)經(jīng)驗(yàn) + 多家企業(yè)客戶 + 靠譜的建站團(tuán)隊
量身定制 + 運(yùn)營維護(hù)+專業(yè)推廣+無憂售后,網(wǎng)站問題一站解決
這篇文章主要介紹c++如何實(shí)現(xiàn)排序和查找,文中介紹的非常詳細(xì),具有一定的參考價值,感興趣的小伙伴們一定要看完!

創(chuàng)新互聯(lián)是一家專注于網(wǎng)站設(shè)計制作、成都網(wǎng)站設(shè)計與策劃設(shè)計,谷城網(wǎng)站建設(shè)哪家好?創(chuàng)新互聯(lián)做網(wǎng)站,專注于網(wǎng)站建設(shè)十多年,網(wǎng)設(shè)計領(lǐng)域的專業(yè)建站公司;建站業(yè)務(wù)涵蓋:谷城等地區(qū)。谷城做網(wǎng)站價格咨詢:028-86922220
1、用冒泡法對數(shù)組進(jìn)行排序(升序)
#include#includevoid sort(int a[], int n){int i, j, t;for (i = 0; i < n-1 ; i++){for (j = 0; j < n-1; j++){if (a[j] > a[j+1]){t = a[j];a[j] = a[j+1];a[j+1] = t;}}}}int main(){int a[5], i;for (i = 0; i < 5; i++){printf("input a[%d]=", i);scanf("%d", &a[i]);}sort(a, 5);for (i = 0; i < 5; i++){printf("%4d", a[i]);}system("pause");return 0;}
2、用插入法排序?qū)⑤斎氲綌?shù)組中的元素進(jìn)行排序
#include#includevoid fun(int a[], int n){int k, j, t;for (j = 1; j < n; j++){t = a[j];k = j - 1;while (k >= 0 && t > a[k]){a[k + 1] = a[k];k--;}a[k + 1] = t;}}int main(){int a[5], i;for (i = 0; i < 5; i++){printf("input a[%d]=", i);scanf("%d", &a[i]);}fun(a, 5);for (i = 0; i < 5; i++){printf("%4d", a[i]);}system("pause");return 0;}
3、用選擇法將輸入的10個數(shù)進(jìn)行排序
#include#includeint main(){int i, j, min, tem, a[10];for (i = 0; i < 10; i++){printf("input a[%d]=", i);scanf("%d", &a[i]);}for (i = 0; i < 10; i++){printf("%d", a[i]);}for (i = 0; i < 10 - 1; i++){min = i;for (j = i + 1; j < 10; j++){if (a[min] > a[j]){min = j;}}tem = a[i];a[i] = a[min];a[min] = tem;}printf("\n");for (i = 0; i < 10; i++){printf("%d", a[i]);}system("pause");return 0;}
4、用折半查找法,將查看輸入的數(shù)字是否在10個元素的升序數(shù)組中,如果在是第幾個
#include#includeint main(){int a[10] = { 12,32,45,62,71,76,80,85,90,95 };int num, bott, top, mid;printf("input a number:");scanf("%d", &num);bott = 0;top = 9;while (bott <= top){mid = (bott + top) / 2;if (num == a[mid]){printf("%d是第%d個數(shù)", num, mid + 1);break;}else if (num < a[mid]){top = mid - 1;}else{bott = mid + 1;}}if (bott > top){printf("no\n");}system("pause");return 0;}
以上是“c++如何實(shí)現(xiàn)排序和查找”這篇文章的所有內(nèi)容,感謝各位的閱讀!希望分享的內(nèi)容對大家有幫助,更多相關(guān)知識,歡迎關(guān)注創(chuàng)新互聯(lián)行業(yè)資訊頻道!