冒泡排序法
算法实现:
//冒泡排序
void BubbleSort(SeqList R, int length)
{
int i, j, exchange = 1;
for (i = length; i >= 1 && exchange; i--)
{
exchange = 0;
for(j=1;j<i;j++)
if (R[j].key > R[j + 1].key)
{
R[0] = R[j];
R[j] = R[j + 1];
R[j + 1] = R[0];
exchange = 1;
}
}
}
冒泡的动态实现
更多信息关注微信订阅号:phpstory