冒泡排序的实现

void Bubble(int *nSource, int nSize)
{
static int nTime = 0;


for (int nOutId=0; nOutId<nSize-1; ++nOutId)
{
++nTime;


bool bNoSwitch = true;


for (int nInerId=0; nInerId<nSize - nOutId - 1; ++nInerId)
{
if (nSource[nInerId] > nSource[nInerId+1])
{
bNoSwitch = false;
int nTemp = nSource[nInerId];
nSource[nInerId] = nSource[nInerId + 1];
nSource[nInerId + 1] = nTemp;
}
}


//地nTime排序
cout<<"第"<<nTime<<"排序"<<endl;
for (int nId=0; nId<nSize; ++nId)
{
cout<<nSource[nId]<< " ";
}
cout<<endl;


if(bNoSwitch)
break;
}
}