冒泡法排序

// maopao.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include "iostream"using namespace std;//目的：按要求从大到小或从小到大排序。//基本思路：对尚未排序的各元素从头到尾依次依次比较相邻的两个元素是否逆序（与欲排顺序相反），若逆序就交换这两元素，//经过第一轮比较排序后便可把最大（或最小）的元素排好，然后再用同样的方法把剩下的元素逐个进行比较，就得到了你所要的顺序。//可以看出如果有N个元素，那么一共要进行n-1轮比较，第I轮要进行j=n-i次比较。（如：有5个元素，则要进行5-1轮比较。第3轮则要进行5-3次比较）//按<规则排序#define MAX_COUNT 64bool maopao_sort(int iArray[],int iCount){int iSwapCount = 0;if (iCount <= 0 || iCount > MAX_COUNT){cout << "bad count value!" << endl;return false;}bool bRet = true;try{int i = 0;;for (int j=iCount-1;j!=0;j--)//共循环iCount - 1次{for (i=0;i!=j;++i){//此循环完成后，最大的数被放到最后。if (iArray[i] > iArray[i+1]){int iTemp = iArray[i+1];iArray[i+1] = iArray[i];iArray[i] = iTemp;cout << "swap value" <<iTemp << ',' << iArray[i+1] << endl;iSwapCount ++;}}}cout << "total swap count = "<<iSwapCount <<endl;}catch(exception &e){cout << "catch a exception!,bad source array!"<<endl;cout << e.what() << endl;bRet = false;}return bRet;}int _tmain(int argc, _TCHAR* argv[]){int iValueToSort[64];int InputValue;int iCount = 0;cout << "plz enter values to sort.press ctrl+break to end input!" <<endl;cout << "values:/t";while (cin>>InputValue){iValueToSort[iCount++] = InputValue;}cout << "The values you enter are :" << endl;for (int i=0;i!=iCount;++i){cout << iValueToSort[i] << '/t';}cout << '/n' << "Total count = " << iCount <<endl;if(maopao_sort(iValueToSort,iCount)){cout << "after sort: "<< endl;for (int i = 0; i!= iCount; ++i){cout << iValueToSort[i] << '/t';}cout << endl;}return 0;}

 

运行结果:

plz enter values to sort.press ctrl+break to end input!
values: 11 23 4 67 232 8 72 34 82 72 56 29 9 2 ^/
The values you enter are :
11      23      4       67      232     8       72      34      82      72
56      29      9       2
Total count = 14
swap value4,23
swap value8,232
swap value72,232
swap value34,232
swap value82,232
swap value72,232
swap value56,232
swap value29,232
swap value9,232
swap value2,232
swap value4,11
swap value8,67
swap value34,72
swap value72,82
swap value56,82
swap value29,82
swap value9,82
swap value2,82
swap value8,23
swap value34,67
swap value56,72
swap value29,72
swap value9,72
swap value2,72
swap value8,11
swap value56,72
swap value29,72
swap value9,72
swap value2,72
swap value56,67
swap value29,67
swap value9,67
swap value2,67
swap value29,56
swap value9,56
swap value2,56
swap value29,34
swap value9,34
swap value2,34
swap value9,29
swap value2,29
swap value9,23
swap value2,23
swap value9,11
swap value2,11
swap value2,9
swap value2,8
swap value2,4
total swap count = 48
after sort:
2       4       8       9       11      23      29      34      56      67
72      72      82      232
请按任意键继续. . .