双向冒泡

按<归则排序

每次循环抽取剩余数组中未排列的数据，取得最大和最小值。

将最小值放剩余数组最前，将最大值放剩余数组最后。

// double_maopao.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include "iostream"using namespace std;bool double_maopao_sort(int iArray[],int count){if (count <= 0){cout << "bad count value:"<<count << endl; return false;}try{for (int i=count -1;i>=0;i-=2){int iMinValue,iMinValuePos,iMaxValue,iMaxValuePos;int iBeginPos = (count - 1 - i)/2;int iEndPos = count - (count - 1 - i)/2 -1;cout << "begin:" << iBeginPos << ",end:" << iEndPos << endl;if (iBeginPos == iEndPos){break;}iMinValue = iMaxValue = iArray[iBeginPos];iMaxValuePos = iMinValuePos = iBeginPos;for (int j = iBeginPos + 1;j <= iEndPos;j++){if (iArray[j] == iMinValue || iArray[j] == iMaxValue){continue;}if (iArray[j] < iMinValue){iMinValue = iArray[j];iMinValuePos = j;continue;}if (iArray[j] > iMaxValue){iMaxValue = iArray[j];iMaxValuePos = j;}}//将本次遍历中最小的放在本次遍历的开始位置，最大的放在本次遍历的结束位置cout << "Max:" << iMaxValue << ",Min:" << iMinValue <<",MaxPos" << iMaxValuePos << ",MinPos" << iMinValuePos << endl;if ((iBeginPos == iMaxValuePos) && (iEndPos == iMinValuePos)){//如果最大的在最前最小的在最后，则互相交换一下。int itemp = iArray[iBeginPos];iArray[iBeginPos] = iArray[iEndPos];iArray[iEndPos] = itemp;}else{//把最小的放在最前面if (iBeginPos != iMinValuePos){int tempForMin = iArray[iBeginPos];iArray[iBeginPos] = iMinValue;iArray[iMinValuePos] = tempForMin;}//确认上面的交换中是否涉及最大值的位置if (iBeginPos == iMaxValuePos){iMaxValuePos = iMinValuePos;}//交换最大值到尾部if (iEndPos != iMaxValuePos){int tempForMax = iArray[iEndPos];iArray[iEndPos] = iMaxValue;iArray[iMaxValuePos] = tempForMax;}}// for (int k = 0; k!= count; ++k)// {// cout << iArray[k] << '/t';// }//cout << endl;}}catch (exception& e){cout << e.what() << endl;return false;}return true;}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(double_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 7 88 4 56 43 110 0 54 22 11 77 8 92 64 32 41^/
The values you enter are :
11      7       88      4       56      43      110     0       54      22
11      77      8       92      64      32      41
Total count = 17
begin:0,end:16
Max:110,Min:0,MaxPos6,MinPos7
begin:1,end:15
Max:92,Min:4,MaxPos13,MinPos3
begin:2,end:14
Max:88,Min:7,MaxPos2,MinPos3
begin:3,end:13
Max:77,Min:8,MaxPos11,MinPos12
begin:4,end:12
Max:64,Min:11,MaxPos12,MinPos7
begin:5,end:11
Max:56,Min:11,MaxPos7,MinPos10
begin:6,end:10
Max:54,Min:22,MaxPos8,MinPos9
begin:7,end:9
Max:43,Min:32,MaxPos8,MinPos7
begin:8,end:8
after sort:
0       4       7       8       11      11      22      32      41      43
54      56      64      77      88      92      110
请按任意键继续. . .