起泡排序

void bubbleSort(SortObject * pvector)

{int i,j,noswap;

RecordNode temp;

for(i=0;i<pvector->n-1;i++)

{

noswap=TRUE;

for(j=0;j<pvector->n-i-1;j++)

{

if(pvector->record[j+1].key<pvector->record[j].key)

{

temp=pvector->record[j];

pvector->record[j]=pvector->record[j+1];

pvector->record[j+1]=temp;

noswap=FALSE

}

}

if(noswap)break;

}


}

你可能感兴趣的:(起泡排序)