#include<stdio.h>
#include<stdlib.h>
#include"student.cpp"
#define NULL 0
void sort(struct student* head,struct student *s);
int main(){
struct student h,*head,*p;
head = &h;h.next=NULL;
float i =1;
while(true){
printf("请输入学生成绩啦(0表示结束)\n");
scanf("%f",&i);
if(i==0) break;
struct student * s = (struct student*)malloc(sizeof(struct student));
s->score = i;
sort(head,s);
}
p= head->next;
do{
printf("%5.1f\n",p->score);
p=p->next;
}while(p!= NULL);
return NULL;
}
void sort(struct student* head,struct student *s){
struct student *p,*temp;
temp=head;
for(p=head;p!=NULL;p=p->next)
if(p->score > s->score)
temp=p;
s->next = temp->next;
temp->next=s;
}
#include<stdio.h>
struct student{
long num ;
float score;
struct student *next;
};
输入链表输出有序链表
最新推荐文章于 2021-05-21 19:26:14 发布