当前位置：文档之家 › C语言排序源码

C语言排序源码

  • 格式：pdf
  • 大小：71.68 KB
  • 文档页数：2

#include <stdio.h>//直接插入排序#define MAX 80void InsertSort(int R[],int n) { /*对数组R中的记录R[1..n]按递增序进行插入排序*/ int i,j;for(i=2;i<=n;i++) /*依次插入R[2]，…，R[n]*/if(R[i]<R[i-1]){ /*若R[i]大于等于有序区中所有的R，则R[i]应在原有位置上*/ R[0]=R[i]; /*R[0]是哨兵，且是R[i]的副本*/j=i-1;do{ /*从右向左在有序区R[1．．i-1]中查找R[i]的插入位置*/R[j+1]=R[j]; /*将关键字大于R[i]的记录后移*/j--;}while(R[0]<R[j]); /*当R[i]≥R[j]时终止*/R[j+1]=R[0]; /*R[i]插入到正确的位置上*/}}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");InsertSort(R,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}#include <stdio.h>//折半插入排序#define MAX 80void InsertSortB(int R[],int n){ /*对数组R中的记录R[1..n]按递增序进折半插入排序*/ int i,j,low,high,mid;for(i=2;i<=n;i++) {R[0]=R[i]; /*保存待插入的元素*/low=1;high=i-1; /*设置初始区间*/while(low<high) { /*二分法寻找插入位置*/mid=(low+high)/2;if(R[0]>R[mid]) /*插入位置在高半区*/low=mid+1;elsehigh=mid-1; /*插入位置在低半区*/}for(j=i-1;j>=high;j--)R[j+1]=R[j]; /*后移元素,留出插入空位*/R[high]=R[0]; /*插入元素*/}}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");InsertSortB(R,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}#include "stdio.h"//希尔排序#define MAX 80void InsertSortC(int R[],int n) { /*对数组R中的记录R[1..n]按递增序进行希尔排序*/ int i,j,jump;jump=n/2; /*给出对n个数据的分组*/while(jump>=1) { /*如果分组数大于1*/for (i=jump;i<=n;i ++){ /*对此组数据进行插入排序*/j=i-jump; /*插入排序的while(j>=1) /*比较数据的下标大于等于1*/if (R[j]>R[j+jump]){ /*如果第j个数据大于同组后面的数据,交换*/R[0]=R[j+jump];R[j+jump]=R[j];R[j]=R[0];j=j-jump; /*比较同组的其他数据*/}elsej =-1; /*比较另外组的数据*/}jump/=2; /*减少分组数*/}}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/ scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");InsertSortC(R,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}#define MAX 80//快速交换排序int partion(int R[],int low,int high) { /*对记录R[low..high]进行一趟快速排序*/R[0]=R[low]; /*将枢轴记录移至数组的闲置分量*/while (low <high) { /*从表的两端交替地向中间扫描*/while (low<high && R[high]>R[0]) high--;if (low<high) { /*将比枢轴记录小的记录移到低端*/R[low]=R[high];low++;}while (low<high && R[low]<R[0]) low++;if (low<high) { /*将比枢轴记录大的记录移到高端*/R[high]=R[low];high--;}}R[low]=R[0]; /*枢轴记录移到正确位置*/return low; /*返回枢轴位置*/}void SwapSortB(int R[],int s,int t) { /*对数组R中的记录R[s..t]按递增序进行快速排序*/int i;if (s<t) {i=partion(R,s,t);SwapSortB(R,s,i-1);SwapSortB(R,i+1,t);}}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");SwapSortB(R,1,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}#define MAX 80//堆排序void Heapify( int R[],int s,int m){ /*对R[s..m]进行堆调整，用temp做暂存单元*/ int j,temp;temp=R[s];j=2*s;while (j<=m){ /*按照数据值较大的结点向下筛选*/if (R[j]>R[j+1]&&j<m)j++; /*j指向关键字码较大的孩子*/if (temp<R[j]) /*不同调整到叶子结点*/break;R[s]=R[j]; /*继续往下调整*/s=j;j=j*2;} /* end of while */R[s]=temp; /*插入数据*/}void BuildHeap(int R[],int n){ /*由一个无序的序列建成一个堆*/int i;for(i=n/2;i>0;i--)Heapify(R,i,n);}void HeapSort(int R [],int n){ /*对R[1..n]进行递减的堆排序，不妨用R[0]做暂存单元*/ int i;BuildHeap(R,n); /* 将R[1-n]建成初始堆*/for(i=n;i>1;i--){/*对当前无序区R[1..i]进行堆排序，共做n-1趟*/ R[0]=R[1];R[1]=R[i];R[i]=R[0]; /*将堆顶和堆中最后一个记录交换*/Heapify(R,1,i-1); /*将R[1..i-1]重新调整为堆，仅有R[1]可能违反堆性质*/ }}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");HeapSort(R,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}#define MAX 80//二路归并排序void Merge(int R[],int low,int m,int high){ /*将两个有序的子文件R[low..m)和R[m+1..high]归并成一个有序的子文件R[low..high] */int i=low,j=m+1,p=0; /*置初始值*/int *R1; /*R1是局部向量，若p定义为此类型指针速度更快*/ R1=(int *)malloc((high-low+1)*sizeof(int));if(!R1){ /*申请空间失败*/puts("fail!");return;}while(i<=m&&j<=high) /*两子文件非空时取其小者输出到R1[p]上*/R1[p++]=(R[i]<=R[j])?R[i++]:R[j++];while(i<=m) /*若第1个子文件非空，则复制剩余记录到R1中*/ R1[p++]=R[i++];while(j<=high) /*若第2个子文件非空，则复制剩余记录到R1中*/ R1[p++]=R[j++];for(p=0,i=low;i<=high;p++,i++)R[i]=R1[p]; /*归并完成后将结果复制回R[low..high]*/}void MergeSort(int R[],int low,int high){ /*用分治法对R[low..high]进行二路归并排序*/int mid;if(low<high) { /*区间长度大于 1 */mid=(low+high)/2; /*分解*/MergeSort (R,low,mid); /*递归地对R[low..mid]排序*/MergeSort (R,mid+1,high); /*递归地对R[mid+1..high]排序*/Merge(R,low,mid,high); /*组合，将两个有序区归并为一个有序区*/}}void main() {int i,n;int R[MAX];clrscr();printf("input number of data: ");scanf("%d",&n);if(n<=0||n>MAX){printf("the number must more than 0 and less than %d.\n",MAX);exit(0);}printf("Please input the data:");for(i=1;i<=n;i++) /*往数组中输入数据*/ scanf("%d",&R[i]);puts("before sorting:");for(i=1;i<=n;i++)printf("%4d",R[i]);printf("\n");MergeSort(R,1,n); /*调用插入排序进行排序*/puts("\n after sorting:");for(i=1;i<=n;i++) /*输出数组元素*/printf("%4d",R[i]);}。

合集下载

C语言源代码

C语言源代码

源文件#include <stdio.h>#include <malloc.h>#include <string.h>#include <stdlib.h>#define NULL 0#define LEN sizeof(struct student)struct student{ char name[20];long int num;int English[4];int Math;int com[30];int ave;struct student *next;};//定义一个结构题int TOTAL_NUM = 0;//学生总数struct student *head = NULL;void welcome (); //欢迎界面void mainmenu (); //主界面void record (); //记录数据void insert(struct student *stu); //插入数据void display(struct student *stu); //显示一个学生的信息void displayAll (); //显示所有学生的信息void query_by_num (); //按学号查询学生信息void readData (); //读取文件里学生的信息void writeData (); //向文件写入学生信息void freeAll (); //清空链表内容void del (); //删除学生信息void change (); //更改学生信息void devise (struct student *p); //选择更改内容int main (void){ welcome ();//显示主菜单mainmenu ();return 0;}//显示欢迎信息void welcome (){printf ("+----------------------------------------------------+\n");printf ("| |\n");printf ("| 欢迎使用计算机科学与技术2班学生信息管理系统|\n");printf ("| |\n");printf ("+----------------------------------------------------+\n");}//系统主菜单void mainmenu (){ int choice;choice = -1;readData ();printf ("\n温馨提示：为保证您的操作得到保存，请按正常顺序退出系统^_^\n");do{printf ("\n\n\n");printf ("\t\t\t--------------------------------------------\n");printf ("\t\t\t+ 计算机科学与技术2班学生信息管理系统|\n");printf ("\t\t\t--------------------------------------------\n");printf ("\t\t\t+ [1]----录入学生信息|\n"); printf ("\t\t\t+ [2]----浏览学生信息|\n"); printf ("\t\t\t+ [3]----查询学生信息|\n");printf ("\t\t\t+ [4]----删除学生信息|\n"); printf ("\t\t\t+ [5]----修改学生信息|\n"); printf ("\t\t\t+ [0]----退出系统|\n"); printf ("\t\t\t+*·*·*·*·*·*·*·*·*·*·*·*·*·*·*|\n");printf ("\t\t\t--------------------------------------------\n");printf ("请输入您的选择：");scanf ("%d", &choice);switch (choice){case 0:writeData ();freeAll ();exit (0);case 1:record ();break;case 2:displayAll ();break;case 3:query_by_num ();break;case 4:del ();break;case 5:change ();break;default:printf ("\n无效选项!");break;}}while (choice != 0);}//录入学生信息void record (){ struct student *p0;p0 = (struct student *)malloc(LEN);printf ("请输入学生的姓名:");scanf ("%s",p0->name);printf ("请输入学生的学号:");scanf ("%ld",&p0->num);printf ("请输入学生的英语分数:");scanf ("%ld",p0->English);printf ("请输入学生的数学分数:");scanf ("%d",&p0->Math);printf ("请输入学生的计算机分数:");scanf ("%ld",p0->com);printf ("请输入学生的平均分:");scanf ("%ld",&p0->ave);insert (p0);printf ("该学生的信息为:\n");printf("-------------------------------------------------------------------------------\n"); printf ("姓名\t学号\t\t英语分数\t数学分数\t计算机分数\t\t平均分\n");display (p0);}void insert (struct student *stu){struct student *p0, *p1, *p2;p1 = head;p0 = stu;if (head == NULL){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 (head == p1)head = p0;elsep2->next = p0;p0->next = p1;}else{p1->next = p0;p0->next = NULL;}}TOTAL_NUM++;}void display (struct student *p){printf ("%s\t%ld\t%d\t%ld\t%ld\t\t%ld\n", p->name, p->num, p->English, p->Math, p->com, p->ave);}//浏览学生信息void displayAll(){struct student *p;printf("学生总数:%d\n", TOTAL_NUM);p = head;if (head != NULL){printf("\n姓名\t学号\t\t英语分数\t数学分数\t计算机分数\t\t平均分\n");printf("-------------------------------------------------------------------------------\n");do{display(p);p = p->next;}while(p != NULL);}printf ("\n");}//按学号查询学生信息void query_by_num (){int num;struct student *p1;printf("请输入学生的学号："); scanf("%ld", &num);if(head==NULL){printf("无学生记录！\n"); return;}p1 = head;while (num!=p1->num && p1->next!=NULL)p1 = p1->next;if (num == p1->num){printf ("姓名\t学号\t\t英语分数\t数学分数\t计算机分数\t\t平均分\n");printf("-------------------------------------------------------------------------------\n"); display (p1);}elseprintf ("没有该学生记录，请核对！");}//写入文件void writeData (){FILE* fp;//文件指针struct student *p;fp = fopen("1.txt", "w");if (!fp){printf("文件打开错误！");return;}fprintf(fp,"%d\n", TOTAL_NUM);for(p = head; p!= NULL; p= p->next){fprintf(fp,"%s\t%ld\t%ld\t%d\t%ld\t%ld\n", p->name, p->num, p->English, p->Math, p->com, p->ave);}fclose (fp);}void freeAll (){struct student *p1, *p2;p1 = p2=head;while(p1){p2=p1->next;free (p1);p1 = p2;}}//读取文件void readData (){FILE* fp;//文件指针struct student *p1, *p2;fp = fopen("1.txt", "r");if (!fp){printf("文件打开错误！");return;}fscanf(fp,"%d\n", &TOTAL_NUM);head = p1 = p2 = (struct student *)malloc(LEN);fscanf(fp,"%s\t%ld\t%ld\t%d\t%ld\t%ld\n", p1->name, &p1->num, p1->English, &p1->Math, p1->com, &p1->ave);while(!feof(fp)){p1 = (struct student *)malloc(LEN);fscanf(fp,"%s\t%ld\t%ld\t%d\t%ld\t%ld\n", p1->name, &p1->num, p1->English, &p1->Math, p1->com, &p1->ave);p2->next = p1;p2 = p1;}p2->next = NULL;fclose(fp);}//删除学生信息void del (){struct student *p1, *p2;long int num;if (head == NULL){printf("无学生记录！\n");return;}printf("请输入您要删除的学生的学号："); scanf("%ld", &num);p1 = head;while (num != p1->num && p1->next != NULL) {p2 = p1;p1 = p1->next;}if(num == p1->num){if(p1 == head)head = p1->next;else p2->next = p1->next;free(p1);TOTAL_NUM--;}elseprintf("没有该学生记录，请核对！\n");}//修改学生信息void change (){struct student *p1, *p2;long int num;if (head == NULL){printf ("无学生记录！\n");return;}printf ("请输入您要修改的学生的学号：");scanf ("%ld", &num);p1 = head;while (num != p1->num && p1->next != NULL){p2 = p1;p1 = p1->next;}if(num == p1->num)devise (p1);elseprintf("没有该学生记录，请核对！\n");}void devise (struct student *p){int choice;choice = -1;do{printf("请选择您要修改的学生的信息内容：\n");printf("+----------------------+\n");printf("| 姓名请按1 |\n");printf("| 学号请按2 |\n");printf("| 英语分数请按3 |\n"); printf("| 数学分数请按4 |\n");printf("| 计算机分数请按5 |\n"); printf("| 平均分请按6 |\n");printf("| 取消请按0 |\n");printf("+----------------------+\n");printf("请输入您的选择：");scanf("%d", &choice);switch (choice){case 0:return;case 1:printf("请输入新姓名："); scanf("%s", p->name);break;case 2:printf("请输入新学号："); scanf("%d", &p->num);break;case 3:printf("请输入新英语分数：");scanf("%s", p->English);break;case 4:printf("请输入新数学分数：");scanf("%s", &p->Math);break;case 5:printf("请输入新计算机分数：");scanf("%s", p->com);break;case 6:printf("请输入新平均分：");scanf("%lf", &p->ave);break;default:printf("\n无效选项!");break;}}while(choice != 0);}。

学生管理系统c语言源代码

学生管理系统c语言源代码


int main()
{
initLinkTable(&head);//初始化表头
readStu();//读入源文件
while (1)
{
menu();
system("cls");
}
}
void initLinkTable(studentLinkPoint *p)
int sum(studentLinkPoint);//求和
void avg(studentLinkPoint);//求平均分
void disAvgSum(studentLinkPoint);//显示总分和平均分
char *inputNumber();//专门用来输入一个学生的学号,返回该字符串的指针
char name[20];
char number[18];
int i;
if(temp==0)
{
error("input");
return 0;
}
else
{
temp->student=(studentPint)malloc(sizeof(studentNod));
break;
case 0:
del(head,end);
break;
}
if(c==0)
exit(1);
}
void del(studentLinkPoint p,studentLinkPoint End)
{
studentLinkPoint q;
if(end==head)
printf(" %3.1f %3.1f\n",p->student->sum,p->student->avg);
c语言经典案例1

c语言经典案例1

题目：猴子吃桃问题：猴子第一天摘下若干个桃子，当即吃了一半，还不瘾，又多吃了一个第二天早上又将剩下的桃子吃掉一半，又多吃了一个。

以后每天早上都吃了前一天剩下的一半零一个。

到第10天早上想再吃时，见只剩下一个桃子了。

求第一天共摘了多少。

1.程序分析：采取逆向思维的方法，从后往前推断。

2.程序源代码：main(){int day,x1,x2;day=9;x2=1;while(day>0){x1=(x2+1)*2;/*第一天的桃子数是第2天桃子数加1后的2倍*/x2=x1;day--;}printf("the total is %d\n",x1);}-----------------------------------------------------------------------------【程序22】题目：两个乒乓球队进行比赛，各出三人。

甲队为a,b,c三人，乙队为x,y,z三人。

已抽签决定比赛名单。

有人向队员打听比赛的名单。

a说他不和x比，c说他不和x,z比，请编程序找出三队赛手的名单。

1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除，则表明此数不是素数，反之是素数。

2.程序源代码：main(){char i,j,k;/*i是a的对手，j是b的对手，k是c的对手*/for(i='x';i<='z';i++)for(j='x';j<='z';j++){for(k='x';k<='z';k++){ if(i!=k&&j!=k){ if(i!='x'&&k!='x'&&k!='z')printf("order is a--%c\tb--%c\tc--%c\n",i,j,k);}}}}-----------------------------------------------------------------------------【程序23】题目：打印出如下图案（菱形）****************************1.程序分析：先把图形分成两部分来看待，前四行一个规律，后三行一个规律，利用双重for循环，第一层控制行，第二层控制列。

学生信息管理系统C语言源代码

学生信息管理系统C语言源代码

#include<stdio.h>#include<malloc.h>#include<string.h>#include<stdlib.h>#define len sizeof(struct student)FILE *fp;struct student{long num;char name[15];int age;char sex[3];char chushen[10];char dizhi[20];char phone[11];char email[20];struct student *next;};void menu(){printf("===========学生信息管理系统==========\n\n");printf(" 1、录入学生信息\n");printf(" 2、浏览学生信息\n");printf(" 3、查询学生信息\n");printf(" 4、删除学生信息\n");printf(" 5、插入学生信息\n");printf(" 6、修改学生信息\n");printf(" 7、排序学生信息\n");printf(" 8、退出管理系统\n");printf("=====================================\n");}struct student *creat() //录入学生信息{int n;struct student *head;struct student *p1,*p2;n=0;p1=p2=(struct student *) malloc(len);scanf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s",&p1->num,&p1->age,p1->name,p1->sex,p1->chushen ,p1->dizhi,p1->phone,p1->email);head=NULL;while(p1->num!=0){n=n+1;if(n==1) head=p1;else p2->next=p1;p2=p1;p1=(struct student *)malloc(len);scanf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s",&p1->num,&p1->age,p1->name,p1->sex,p1->chu shen,p1->dizhi,p1->phone,p1->email);}p2->next=NULL;return(head);}void insert(struct student *head) //插入学生信息{int search_num;struct student *p,*q,*s;p=head;printf("在哪个学生前插入请输入学号：\n");scanf("%d",&search_num);while((p!=NULL)&&(p->num!=search_num)){q=p;p=p->next;}s=(struct student *)malloc(len);q->next=s;system("cls");printf("请输入学生信息:\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");scanf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s",&s->num,&s->age,s->name,s->sex,s->chushen,s->diz hi,s->phone,s->email);s->next=p;}void printList(struct student *head) //浏览全部学生信息{struct student *p;p=head;if(head==NULL)printf("没有学生信息!!\n");else{do{fread(p,len,1,fp);printf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s\n",p->num,p->age,p->name,p->sex,p->chushen,p->diz hi,p->phone,p->email);p=p->next;}while(p!=NULL);}}void findList_num(struct student *head,long search_num) //按学号查找{struct student *p;p=head;while((p!=NULL)&&(p->num!=search_num))p=p->next;if(p!=NULL)printf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s\n",p->num,p->age,p->name,p->sex,p->chushen,p->diz hi,p->phone,p->email);elseprintf("没有该学生信息!!\n");}void findList_name(struct student *head,char *search_name) //按姓名查找{struct student *p;int cmp1=0,cmp=0;p=head;while(p!=NULL)if(strcmp(p->name,search_name)!=0){p=p->next;cmp++;}else{printf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s\n",p->num,p->age,p->name,p->sex,p->chushen,p->dizhi,p->phone,p->email);p=p->next;cmp1=1;}if(cmp!=0&&cmp1==0)printf("没有该学生信息!!\n");}void xiugai(struct student *p1,long xiu_num) //修改学生信息{struct student *p2;p2=p1;while((p2!=NULL)&&(p2->num!=xiu_num))p2=p2->next;if(p2!=NULL){scanf("%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s",&p2->num,&p2->age,p2->name,p2->sex,p2->chu shen,p2->dizhi,p2->phone,p2->email);}elseprintf("没有该学生信息!!\n");}struct student *delList(struct student *head,long del_num) // 删除学生信息{struct student *p,*q;p=head;q=head;while(p &&(p->num != del_num)){q=p;p=p->next;}if(p==NULL)printf("无此学号!\n");else{if(p == head){head = p->next;free(p);}else{q->next = p->next;free(p);}}return head;}void paixu(struct student *head) //按学号排序{struct student *p,*f,*t;char ch[100];int i;t=f=p=head;for(p=head;p->next!=NULL;p=p->next){for(t=head,f=t->next;t->next!=NULL;t=t->next,f=f->next){if(t->num>f->num>0){i=t->num;t->num=f->num;f->num=i;i=t->age;t->age=f->age;f->age=i;strcpy(ch,t->name);strcpy(t->name,f->name);strcpy(f->name,ch);strcpy(ch,t->sex);strcpy(t->sex,f->sex);strcpy(f->sex,ch);strcpy(ch,t->chushen);strcpy(t->chushen,f->chushen);strcpy(f->chushen,ch);strcpy(ch,t->dizhi);strcpy(t->dizhi,f->dizhi);strcpy(f->dizhi,ch);strcpy(ch,t->phone);strcpy(t->phone,f->phone);strcpy(f->phone,ch);strcpy(ch,t->email);strcpy(t->email,f->email);strcpy(f->email,ch);}}}// return head;}void save(struct student *head) //保存为磁盘文件{struct student *p;if((fp=fopen("keshe","w"))==NULL){printf("cannot open this file\n");exit(0);}p=head;while(p!=NULL){fprintf(fp,"%d\n",p->num);fprintf(fp,"%d\n",p->age);fprintf(fp,"%s\n",p->name);fprintf(fp,"%s\n",p->sex);fprintf(fp,"%s\n",p->chushen);fprintf(fp,"%s\n",p->dizhi);fprintf(fp,"%s\n",p->phone);fprintf(fp,"%s\n",p->email);p=p->next;}fclose(fp);}struct student *read() //从磁盘读取文件{struct student *head=NULL;struct student *p=NULL;struct student *t=NULL;int a;// fp=fopen("keshe","r");if((fp=fopen("keshe","r"))==NULL){printf("cannot open this file\n");exit(0);}while(1){t=(struct student *)malloc(len);a=fscanf(fp,"%d\t%d\t%s\t%s\t%s\t%s\t%s\t%s",&t->num,&t->age,t->name,t->sex,t->chush en,t->dizhi,t->phone,t->email);if(a==0||a==-1)return head;t->next=NULL;if(p==NULL){p=t;head=t;}else{p->next=t;p=p->next;p->next=NULL;}}fclose(fp);}void main(){int code=0;struct student *pt = NULL;while(code!=8){menu();printf("请输入上述序号进行操作:\n");scanf("%d",&code);system("cls");switch(code){case 1:{system("cls");printf("每个学生的信息之间用Tab键分隔\n");printf("===========================录入学生信息==============================\n");printf("---------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");pt=creat();save(pt);system("cls");printf("===========================录入学生信息==============================\n");printf("---------------------------------------------------------------------\n");printf("************录入学生信息成功***********!!\n");printf("按回车键返回主菜单\n");getchar();getchar();system("cls");};break;case 2:{system("cls");printf("===========================学生信息表================================\n");printf("---------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");pt=read();printList(pt);printf("================================================================ =====\n");printf("---------------------------------------------------------------------\n");printf("\n按回车键返回主菜单\n");getchar();getchar();system("cls");};break;case 3:{int search=0;system("cls");printf("===========================查询学生信息==============================\n");printf("---------------------------------------------------------------------\n");while(search!=3){printf("1、按学号查询\n2、按姓名查询\n3、退出查询\n");scanf("%d",&search);switch(search){case 1:{long search_num;system("cls");printf("请输入学生学号\n");scanf("%d",&search_num);system("cls");printf("===========================查询结果==================================\n");printf("---------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");findList_num(read(),search_num);printf("================================================================ =====\n");printf("---------------------------------------------------------------------\n");printf("\n按回车键返回查询菜单\n");getchar();getchar();system("cls");};break;case 2:{char search_name[15];system("cls");printf("请输入学生姓名\n");scanf("%s",search_name);system("cls");printf("===========================查询结果==================================\n");printf("---------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");findList_name(read(),search_name);printf("================================================================ =====\n");printf("---------------------------------------------------------------------\n");printf("\n按回车键返回查询菜单\n");getchar();getchar();system("cls");};}}system("cls");};break;case 4:{long del_num;system("cls");printf("===========================删除学生信息==============================\n");printf("---------------------------------------------------------------------\n");printf("请输入要删除学生信息的学号:\n");scanf("%d",&del_num);system("cls");pt=delList(read(),del_num);save(pt);printf("===========================删除结果================================\n");printf("-------------------------------------------------------------------\n");printf("学号为%d的学生信息成功删除\n",del_num);printf("\n按回车键返回主菜单\n");getchar();getchar();system("cls");};break;case 5:{system("cls");printf("每个学生的信息之间用Tab键分隔\n");printf("===========================插入学生信息==============================\n");printf("---------------------------------------------------------------------\n");insert(pt);save(pt);system("cls");printf("===========================插入学生信息==============================\n");printf("---------------------------------------------------------------------\n");printf("****插入学生信息成功***!!\n\n");printf("按回车键返回主菜单\n");getchar();getchar();system("cls");}break;case 6:{long search_num;system("cls");printf("请输入要修改的学生学号:\n");scanf("%d",&search_num);system("cls");printf("每个学生的信息之间用Tab键分隔\n");printf("===========================修改学生信息==================================\n");printf("-------------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");findList_num(read(),search_num);printf("\n");printf("请输入修改信息:\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");pt=read();xiugai(pt,search_num);save(pt);printf("================================================================ =====\n");printf("---------------------------------------------------------------------\n");printf("****修改学生信息成功***!!\n\n");printf("\n按回车键返回查询菜单\n");getchar();getchar();system("cls");};break;case 7:{system("cls");printf(" 按学号从小到大排序\n\n");printf("===========================学生信息表================================\n");printf("---------------------------------------------------------------------\n");printf("学号\t年龄\t姓名\t性别\t出生\t地址\t电话\te-mail\n");pt=read();paixu(pt);printList(pt);save(pt);printf("================================================================ =====\n");printf("---------------------------------------------------------------------\n");printf("\n按回车键返回主菜单\n");getchar();getchar();system("cls");};break;case 8:read();break;}}}。