我不知道这是否是基本的,但我只知道如何按升序排序。如何按降序对链表进行排序?
system("cls");
if (headptr != (struct online*)NULL)
{
currentptr = headptr;
for(; currentptr->ptrnext != NULL; currentptr = currentptr->ptrnext)
{
for(newptr = currentptr->ptrnext; newptr != (struct online*)NULL; newptr = newptr->ptrnext)
{
if(currentptr->score > newptr->score)
{
int temp = currentptr->score;
currentptr->score = newptr->score;
newptr->score = temp;
}
}
}
}
这部分负责对订单作出决定?什么是补充操作? –
重复了很多问题...你尝试过: http://stackoverflow.com/questions/5526750/linked-list-sorting-in-c http://stackoverflow.com/questions/11813696/sorting -a-linked-list-in-c 甚至简单的谷歌? 如果您可以按升序对其进行排序,则可以通过颠倒比较来颠倒顺序,就像这里提到的答案一样。 –