冒泡排序

void bubbleAlgorithm(int *pNum,int nSize){    if(NULL !=  pNum){        bool bExchange = false;        cout<<"before sorting:"<<endl;        for(int i =0 ; i < nSize ;i++){            cout<<pNum[i]<<" ";        }        cout<<endl;        for(int i = 0; i < nSize-1; i++){            for(int j = nSize-1; j > i ;j--){                if( pNum[j-1] > pNum[j]){                    swap(&pNum[j-1],&pNum[j]);                    bExchange = true;                }            }            if(!bExchange){                cout<<"数组是有序的,无须继续进行排序"<<endl;                return ;            }        }        cout<<"after sorting:"<<endl;        for(int i =0 ; i < nSize ;i++){            cout<<pNum[i]<<" ";        }        cout<<endl;    }}