//冒泡算法改进
void bubblesort_pro(element E[], int n)
{
int numpairs, firstchange, lastchange;
int didswitch, i;
numpairs = n - 1;
didswitch = 1;
firstchange = 1;
lastchange = -1;
while (didswitch) {
didswitch = 0;
if (firstchange == 0) {
i = 0;
}
else {
i = firstchange - 1;
}
for (; i < numpairs; i++) {
if (E[i] > E[i + 1]) {
swap(E[i], E[i + 1]);
if (!didswitch) {
firstchange = i;
}
lastchange = i;
didswitch = 1;
}
}
numpairs = lastchange;
}
}
冒泡算法改进
最新推荐文章于 2024-07-11 21:13:07 发布