c语言程序设计 学生成绩排序系统#include
#include
#include
#include
#define MAX 200
void dis_menu();
void load_score();
void sort_english();
void sort_math();
void sort_c();
void sort_num();
void display();
typedef struct
char name[20];
int num;
float math;
float english;
float c;
}Stu;
Stu stu[MAX];
int num=0;
bool tag=true;
bool Tag=false;
void main()
dis_menu();
void dis_menu()
int i=0;
char ch;
printf("******** *欢迎使用学生成绩排序系统* ********** ******\n");
printf("****** ****输入要进行的操作****** ******* ***** *\n");
printf("**** ******1:按数学成绩排序********** **** ***** **\n");
printf("** ********2: 按英语成绩排序***** * ***** ***\n");
printf("* *********3:按C语言成绩排序***** * ************ **\n");
printf("*** *******4:按学生学号排序****** ***** ***** *\n");
printf("***** *****5:载入学生成绩**** ********* *****\n");
printf("******* ***0:退出系统********* ************** ***\n");
fflush(stdin);
scanf("%d",&i);
switch(i)
case 1:
if(!Tag) { printf("先载入学生成绩!\n"); break; }
sort_math();
printf("是否打印排序后学生成绩:(Y or N)\n");
fflush(stdin);
ch=getchar();
switch(ch)
{
case 'Y':
case 'y':
display();
break;
default:break;
}
break;
case 2:
if(!Tag) { printf("先载入学生成绩!\n"); break; }
sort_english();
printf("是否打印排序后学生成绩:(Y or N)\n");
fflush(stdin);
ch=getchar();
switch(ch)
{
case 'Y':
case 'y':
display();
break;
default:break;
}
break;
case 3:
if(!Tag) { printf("先载入学生成绩!\n"); break; }
sort_c();
printf("是否打印排序后学生成绩:(Y or N)\n");
fflush(stdin);
ch=getchar();
switch(ch)
{
case 'Y':
case 'y':
display();
break;
default:break;
}
break;
case 4:
if(!Tag) { printf("先载入学生成绩!\n"); break; }
sort_num();
printf("是否打印排序后学生成绩:(Y or N)\n");
fflush(stdin);
ch=getchar();
switch(ch)
{
case 'Y':
case 'y':
tag=false;
display();
break;
default:break;
}
break;
case 5:
load_score();
Tag=true;
printf("是否打印载入后的学生成绩:(Y or N)\n");
fflush(stdin);
ch=getchar();
switch(ch)
{
case 'Y':
case 'y':
tag=false;
display();
break;
default:break;
}
break;
default:
printf("感谢使用本系统!\n");
system("exit");
exit(0);
printf("是否继续?(Y or N)\n");
fflush(stdin);
ch=getchar();
system("cls");
}while(ch=='Y'||ch=='y');
void load_score()
int i;
printf("输入学生人数\n");
scanf("%d",&num);
printf("学生学号 姓名 数学成绩 英语成绩 C语言成绩 \n");
for(i=0;iMAX)
printf("输入人数有误!");
void display()
int i=0;
if(tag)
printf("名次\t学号\t姓名\t数学\t英语\tC语言\n");
for(i=0;i=stu[j].num)
temp=stu[j-1];
stu[j-1]=stu[j];
stu[j]=temp;
printf("排序完成!\n");
刚写的，希望对你有用，考试顺利！#include"stdio.h"
#include"string.h"
#define n 1000
void menu();
int password();
int dedao();
int uninque(struct student shu[],int len,int xuehao);
void shuchu(struct student shu[],int len);
void send(struct student shu[],int len);
int readfromfile(struct student shu[]);
void chaxun(struct student shu[],int len);
void paixu(struct student shu[],int len);
struct student
int num;
char name[10];
int score;
} shu[n];
main()
{ int len=0,key,choice;
do {
key=password();
}while(key==0);
while(1)
{ menu();
printf("请输入选项\n");
scanf("%d",&choice);
switch(choice)
case 1:printf("输入信息函数\n"); len=dedao(shu,len); break;
case 2:printf("输出函数被调用\n"); shuchu(shu,len); break;
case 3:printf("保存到文件函数被调用\n"); send(shu,len); break;
case 4:printf("从文件读函数被调用\n"); len=readfromfile( shu); break;
case 5:printf("按学号查询函数被调用\n"); chaxun(shu,len); break;
case 6:printf("按成绩排序函数被调用\n"); paixu(shu,len); break ;
case 7:exit(0);break;
void menu()
printf("\n");
printf(" *******************************************\n");
printf(" * 学生成绩管理系统2.0 *\n");
printf(" * 1.输入信息 *\n");
printf(" * 2.输出信息 *\n");
printf(" * 3.保存到文件 *\n");
printf(" * 4.从文件读 *\n");
printf(" * 5.按学号查询 *\n");
printf(" * 6.按成绩排序（由大到小） *\n");
printf(" * 7.程序结束 *\n");
printf(" *******************************************\n");
int password()
char a[100];
char key[]="asd";
printf("请输入密码\n");
scanf("%s",&a);
if(strcmp(a,key)==0)
return 1;
else
return 0;
int dedao(struct student shu[],int len)
{ int i=len;
int flag=0;
int xuehao,bank,chengji;
while(i<n)
while(1)
printf("学号");
scanf("%d",&xuehao);
if(xuehao==0)
{ flag=1;
break;
bank=uninque(shu,i,xuehao);
if(bank==0)
{ shu[i].num=xuehao;
break;}
if(flag==1)
break;
printf("姓名");
scanf("%s",&shu[i].name);
while (1)
printf("成绩");
if(scanf("%d",&chengji)==1)
{break;}
printf("输入格式错误，请重新输入！");
while(getchar()!='\n')
continue;
while(getchar()!='\n')
continue;
shu[i].score=chengji;
i++;
return i;
int uninque(struct student shu[],int len,int xuehao)
{ int i;
int bank=0;
for (i=0;i<len;i++)
if(xuehao==shu[i].num)
bank=1;
return bank;
void shuchu(struct student shu[],int len)
int i;
printf("%-4s %-10s %-3s","学号","姓名","成绩
");
for(i=0;i<len;i++)
printf("%-4d %-10s %-3d",shu[i].num,shu[i].name,shu[i].score);
printf("\n");
printf("
");
void send(struct student shu[],int len)
int i;
file *fp;
fp=fopen("d:\\chegnji.txt","wb");
if(fp==null)
printf("打开文件出错！\n");
exit(0);
for(i=0;i<len;i++)
fwrite(shu+i,sizeof(struct student),1,fp);
fclose(fp);
int readfromfile(struct student shu[])
file *fp=null;
int i=0;
fp=fopen("d:\\chegnji.txt","rb");
if(fp!=null)
printf("%-4s %-10s %-3s","学号","姓名","成绩
");
while(!feof(fp))
if(i>=n)
break;
if(fread(shu+i,sizeof(struct student),1,fp))
printf("%-4d %-10s %-3d",shu[i].num,shu[i].name,shu[i].score);
printf("\n");
i++;
fclose(fp);
i=i-1;
return i;
void chaxun(struct student shu[],int len)
int i,nue,b=0;
while(1)
{printf("input the student number (input'0' close) ");
scanf("%d",&nue);
b=0;
if(nue==0)
break;
for (i=0;i<len;i++)
if(nue==shu[i].num)
{ printf("%-4s %-10s %-3s","学号","姓名","成绩
【成绩排名升降对比函数公式 成绩排名函数公式voidsort】");
printf("%-4d %-10s %-3d\n",shu[i].num,shu[i].name,shu[i].score);
b=1;
if(b==0)
printf("the number is not exist!\n");
void paixu(struct student shu[],int len)
int i,j;
struct student temp;
printf("%-4s %-10s %-3s","学号","姓名","成绩
");
for(i=0;i<len;i++)
for(j=i;j<len;j++)
if(shu[j].score>shu[i].score)
temp=shu[j];
shu[j]=shu[i];
shu[i]=temp;
printf("%-4d %-10s %-3d\n",shu[i].num,shu[i].name,shu[i].score);

文章插图
函数sort(int a[],int n)，用函数实现对n个学生成绩从高到低排名sort(int a[],int n)
int i,j,k,temp;
for(i=0;i
查看全文

查看追问

追问:
怎么没有开头的，我是C语言白痴，大神帮帮忙

追答:
看看这个，因为同学数是未知的，所以我先让其输入有几位同学了，应该符合题意了吧！！！
#include
#include
void sort(int a[],int n)
int i,j,k,temp;
for(i=0;i

追问:
我这个是学生人数，你这个d是换成f，还是d也可以

追答:
什么意思？


2011-11-21


0




更多回答(1)

其他回答
1条回答


新阳光
不用多大改动，//为有改动之处，一看便知．
#include
#define n 10//
int sort (int a[],int n)//
int i=0,j=0,t;
for(i=0;ia[j])
t=a[j];
a[j]=a[i];
a[i]=t;
for(i=0;i
2011-11-21


0



var sogou_div_805186 = document.getElementById("sogou_wap_805186");
window.sogou_un = window.sogou_un || [];
window
.sogou_un
.push({id: 805186, ele: sogou_div_805186, w: 20, h: 20});

window._gtag = window._gtag || {};
_gtag.feedAdInfo = {"wm12":{"page":6,"index":1},"wm32":{"page":3,"index":5},"tbt":{"page":1,"index":2},"wmx2":{"page":5,"index":5},"gdt1":{"page":0,"index":0},"gdt3":{"page":0,"index":0},"bkv":{"page":0,"index":0},"360":{"page":0,"index":0},"ta":{"page":3,"index":1},"tb":{"page":0,"index":0},"qtr":{"page":2,"index":2},"wmd":{"page":0,"index":0},"gdtx":{"page":0,"index":0},"zp":{"page":0,"index":0},"wmx1":{"page":4,"index":3},"wm1":{"page":5,"index":1},"wm3":{"page":0,"index":0},"gdtd":{"page":0,"index":0},"xxl1":{"page":4,"index":1},"xxl2":{"page":4,"index":1}};
_gtag.ka_zhibo_switch_on = false;
_gtag.ka_youxi_switch_on = false;
_gtag.showBKVideo = true;
? 2022 SOGOU.COM

window._gtag = window._gtag || {};
window._gtag.shouldGrayed = false;
window._gtag.logoSelector = '.nav_logo, .nr-logo';
_gtag.userId = '-1';
_gtag.uid = '-1';
//灰度页tag只有一个
_gtag.tags = '137';
_gtag.firstTagName = 'IT技术';
_gtag.id = '878165588';
_gtag.query = '';
_gtag.title = '%E5%87%BD%E6%95%B0sort(int%20a%5B%5D%2Cint%20n)%EF%BC%8C%E7%94%A8%E5%87%BD%E6%95%B0%E5%AE%9E%E7%8E%B0%E5%AF%B9n%E4%B8%AA%E5%AD%A6%E7%94%9F%E6%88%90%E7%BB%A9%E4%BB%8E%E9%AB%98%E5%88%B0%E4%BD%8E%E6%8E%92%E5%90%8D';
_gtag.traceId = '762116fe363f47bfaf66737f9d0c2eda';
_gtag.jumpLoginUrl = '?style=9&appid=1600000108&low_login=0&daid=391&hln_css=&pt_no_onekey=0&s_url=http%3A%2F%2F127.0.0.1%3A8083%2Fpage%2Fold%2Fq878165588%3F_traceid%3D762116fe363f47bfaf66737f9d0c2eda';
_gtag.isLogin = false
//搜索广告替换百川 & 智搜广告，10 % 灰度 - 2019.03 .20
_gtag.grayAllow = true;
_gtag.renderBanner = true;
//是否显示网盟广告
_gtag.isShowWangMengAd = false;
_gtag.uuid = "3165939489";
_gtag.feedHotWorldGray = true;
_gtag.adPriority = 'cd,zy,ss,gdt,wm';
_gtag.adTBSwitch = false;
_gtag.adGDTSwitch = true;
_gtag.adWMSwitch = true;
_gtag.adYMSwitch = false;
_gtag.adCDSwitch = true;
_gtag.adTBTSwitch = false;
_gtag.adEBKSwitch = false;
_gtag.adXXLSwitch = false;
_gtag.bkInner = false;
_gtag.adTuiaSwitch = true;
_gtag.showTaAd = false;
//屏蔽只针对最佳答案下方的网盟广告，feed流中的网盟广告不受影响
_gtag.showWmBrowser = true;
_gtag.htymSwitch = false;
//qq浏览器
_gtag.mQBUa = false;
_gtag.h5gray = false;
//是否为qb小程序
_gtag.miniProgramUa = false;
//porn值
_gtag.levelInfo = '';
//自营广告
_gtag.adSelfOperateList = [];
_gtag.adWendaSelfOperateList = [];
//搜狗阅读banner广告
_gtag.yueduBannerSwtich = false;
//百科搜索词
_gtag.baikeSearchSwitch = false;
_gtag.baikeSearchWords = [];
_gtag.showRelatedSearch = true;
if (!window._gtag) {
_gtag = {};
}
_gtag.ww_touchstone_info_list = {
'reportEnv': '2',
'hitTest': '{"18":{"itemId":1,"groupId":18,"layerId":0,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"wmshow","varValue":"1","extParamMap":{"pid":"sogou-waps-40dfe505df48f152"}},"42":{"itemId":15,"groupId":42,"layerId":0,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"relaquestion","varValue":"1","extParamMap":{"pid":"sogou-waps-d85688fce6136697"}},"43":{"itemId":20,"groupId":43,"layerId":0,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"askkey","varValue":"0","extParamMap":{"pid":"sogou-waps-8e636fbd9b5bd3c7"}},"62":{"itemId":38,"groupId":62,"layerId":1,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"FoldLineNum","varValue":"25","extParamMap":{}},"64":{"itemId":30,"groupId":64,"layerId":2,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"NiceQue","varValue":"1","extParamMap":{}},"66":{"itemId":43,"groupId":66,"layerId":0,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"shenmain","varValue":"0","extParamMap":{"pid":"sogou-waps-ec88121df4e8a5ea"}},"68":{"itemId":47,"groupId":68,"layerId":1,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"hotSearch","varValue":"0","extParamMap":{}},"69":{"itemId":49,"groupId":69,"layerId":1,"channelId":1,"productId":1,"report":false,"reportStatus":"0","varName":"thumbStyle","varValue":"0","extParamMap":{}}}'
};
//无线问问来源统一用254
var orig = 254;
_gtag.orig = 254;
var ua = window
.navigator
.userAgent
.toLowerCase();
//如果是搜索app
if (/sogousearch/ig.test(ua)) {
orig = 255;
_gtag.orig = 255;
}
_gtag.fromWeiXin = false;
不用多大改动，//为有改动之处，一看便知．
#include
#define n 10//
int sort (int a[],int n)//
int i=0,j=0,t;
for(i=0;ia[j])
t=a[j];
a[j]=a[i];
a[i]=t;
for(i=0;i
2011-11-21


0

• rank函数排名公式 成绩排名函数公式视频
• 大理十大旅游景点 大理十大旅游景点排名
• 成绩排名函数公式 成绩排名函数公式voidsort
• 统计成绩排名函数公式 成绩排名函数公式rank
• 成绩排名函数公式void sort 成绩排名函数公式rank
• 统计成绩排名函数公式 成绩排名函数公式
• 成绩多条件排名函数公式 成绩排名函数公式
• 成绩排名函数rank怎么用 成绩排名函数wps
• RANK函数计算排名 成绩排名函数rank怎么用
• excel函数rank 成绩排名函数excel公式