c语言学生管理系统之冒泡排序

最新推荐文章于 2023-07-23 15:59:42 发布

MckinleyLu

最新推荐文章于 2023-07-23 15:59:42 发布

阅读量2k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/LuTong2018/article/details/82313290

本文介绍了三种基于链表实现的排序算法：按平均分排序、字典序排序和按学号排序。通过具体代码展示了每种排序算法的具体实现过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include "header.h"
void PaixuAverage(LINK head) //平均分排序
{
LINK p, prep, temp, tail;
tail = NULL;
while( head->next != tail )
{
prep = head;
p = head->next;
while( p->next != tail )
{
if( p->average < p->next->average )
{
temp = p->next;
prep->next = p->next;
p->next = p->next->next;
prep->next->next = p;
p = temp;
}
p = p->next;
prep = prep->next;
}
tail = p;
}

}

void paixuName(LINK head) //字典排序
{
LINK p, prep, temp, tail;
tail = NULL;
while( head->next != tail )
{
prep = head;
p = head->next;
while( p->next != tail )
{
if(strcmp(p->name,p->next->name))
{
temp = p->next;
prep->next = p->next;
p->next = p->next->next;
prep->next->next = p;
p = temp;
}
p = p->next;
prep = prep->next;
}
tail = p;
}
}

void paixuxueHao(LINK head) //学号排序
{
LINK p, prep, temp, tail;
tail = NULL;
while( head->next != tail )
{
prep = head;
p = head->next;
while( p->next != tail )
{
if( p->number > p->next->number )
{
temp = p->next;
prep->next = p->next;
p->next = p->next->next;
prep->next->next = p;
p = temp;
}
p = p->next;
prep = prep->next;
}
tail = p;
}