c语言实现数据库

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#define LEN sizeof(struct student)

struct student *creat();
struct student *del(struct student *head,int num);
struct student *insert(struct student *head,struct student *stu_2);//第一个参数是被插入的链表
																//第二个参数是待插入的结点 
void print(struct student *head);

struct student{
	int num;
	float score;
	struct student *next;
};

int n;

int main(){
	int num;
	struct student *stu,*p,*stu_2;
	stu=creat();
	p=stu;
	print(stu);
	
	printf("please enter the num to delete:");
	scanf("%d",&num);
	while(num != 0){
		p=del(p,num);
		print(p);
		printf("please enter the num to delete:");
		scanf("%d",&num);
	}
	stu_2=(struct student *)malloc(LEN);
	printf("\nplease input the num to insert:"); 
	scanf("%d",&stu_2->num);
	printf("\nplease input the score");
	scanf("%f",&stu_2->score);
	while(stu_2->num!=0){
		p=insert(p,stu_2);
		print(p);
		stu_2=(struct student *)malloc(LEN);
		printf("\nplease input the num to insert:"); 
		scanf("%d",&stu_2->num);
		printf("\nplease input the score");
		scanf("%f",&stu_2->score);
	}
	printf("\n\n");
	system("pause");
}

struct student *creat(){
	struct student *head;
	struct student *p1,*p2;
	
	p1=p2=(struct student *)malloc(LEN);
	
	printf("please enter the num:");
	scanf("%d",&p1->num);
	printf("please enter thr score:");
	scanf("%f",&p1->score);
	
	head=NULL;
	n=0;
	
	while(p1->num){
		n++;
		if(1==n){
			head=p1;
		}else{
			p2->next=p1;
		}
		p2=p1;
		p1=(struct student *)malloc(LEN);
		
		printf("please enter the num:");
		scanf("%d",&p1->num);
		printf("please enter the score:");
		scanf("%f",&p1->score);
		
	}
	p2->next=NULL;
	return head;
}
void print(struct student *head){
	struct student *p;
	printf("\nthere are %d records!\n\n",n);
	p=head;
	if(head){
		do{
			printf("学号为%d的成绩是：%f\n",p->num,p->score);
			p=p->next;
		}while(p);
	}
}
struct student *del(struct student *head,int num){
	struct student *p1,*p2;
	if(NULL==head){
		printf("\nThis list is null!\n");
		goto END;
	}
	p1=head;
	while(p1->num!=num && p1->next != NULL){
		p2=p1;
		p1=p1->next;
	}
	if(num==p1->num){
		if(p1==head){
			head=p1->next;
		}else{
			p2->next=p1->next;
		}
		printf("\nDelete No:%d succeed!\n",num);
		n=n-1;
	}else{
		printf("%d not been found!\n",num);
	}
	END:
		return head;
}

struct student *insert(struct student *head,struct student *stu_2){
	struct student *p0,*p1,*p2;
	p1=head;
	p0=stu_2;
	if(NULL==head){
		head=p0;
		p0->next=NULL;
	}else{
		while((p0->num > p1->num)&&(p1->next != NULL)){
			p2=p1;
			p1=p1->next;
		}
		if(p0->num <= p1->num){
			if(p1==head){
				head=p0;
			}else{
				p2->next=p0;
			}
			p0->next=p1;
		}else{
			p1->next=p0;
			p0->next=NULL;
		}
	}
	n=n+1;
	return head;
}