用链表实现id，姓名，分数的录入功能和排序功能

#include
#include
#include

#define N 5  //录入数据的用户个数
#define M 20  //用户名字长度 char

structstudent
{
 intid; //用户ID
 char *pname; //用户姓名
 intscore;//用户分数
}*pstd;

void init(void)
{
 pstd= (student *)malloc(sizeof(student) * N);
 for (inti = 0;i < N;i++)
 {
  printf("user->%d:\n", i + 1);
  scanf_s("%d", &((pstd+ i)->id));
  getchar();
  (pstd+ i)->pname= (char *)malloc(sizeof(char) * M);
  scanf_s("%s", (pstd+ i)->pname, M);
  getchar();
  scanf_s("%d",&((pstd+ i)->score));
  getchar();
 }
}
void show(void)
{
 printf("\n\n\n");
 for (inti = 0;i < N;i++)
 {
  printf("%d\n", (pstd+ i)->id);
  printf("%s\n", (pstd+ i)->pname);
  printf("%d\n", (pstd+ i)->score);
  printf("\n\n\n");
 }
}
void compare(void)
{
 student t;
 t.pname= (char *)malloc(sizeof(char) * M);
 for (inti = 0;i < N-1;i++)
 {
  for (intj = i + 1;j < N;j++)
  {
   if ((pstd+ i)->score < (pstd+ j)->score)
   {
    t.score= (pstd+ i)->score;
    (pstd+ i)->score = (pstd+ j)->score;
    (pstd+ j)->score = t.score;

    t.id= (pstd+ i)->id;
    (pstd+ i)->id = (pstd+ j)->id;
    (pstd+ j)->id = t.id;

    strcpy_s(t.pname,M,(pstd+ i)->pname);
    strcpy_s((pstd+ i)->pname,M,(pstd+ j)->pname);
    strcpy_s((pstd+ j)->pname,M,t.pname);
   }
  }
 }
}
intmain(intargc, char **argv)
{
 init();//初始化数组
 show();//显示数组
 compare();//从高到低排序
 show();//排序后展示
 system("pause");
 return 0;
}

功能函数如上图所示