题目一:冒泡排序数组,由小到大
#include <stdio.h>
int main(){
int Sort(int a[],int n);
int
n=5;
int
a[n];
int
b[5];
int
q;
printf(“input
5 numbers: \n”);
for(int
q=0;q<5;q++)
scanf("%d",&a[q]);
b[5]=Sort(
a, 5);
return
0;
printf(“the
sorted number is:\n”);
for(int
i=0;i<5;i++)
printf("%d",b[i]);
printf("\n");
}
int
Sort(int a[],int n){
int
i,j;
bool
change;
int
m;
for(i=n-1,change=true;i>=1&&change;–i)
{
change=false;
for(j=0;j<i;++j)
if(a[j]>a[j+1])
{
m=a[j];a[j]=a[j+1];a[j+1]=m;change=true;
}
}
}
题目二:结构体实验
#include<stdio.h>
#include<string.h>
int main(){
struct
Student
{
long
int num;
char
name[20];
char
sex;
char
addr[20];
int
age;
float
score;
};
struct
Student stu[5]={
1,“jia”,‘m’,“nanjin”,18,90,2,“bing”,‘W’,“nanjin”,18,92,
3,“yi”,‘M’,“nanjin”,18,82,4,“ding”,‘W’,“nanjin”,19,89,
5,“wu”,‘W’,“nanjin”,20,98
};
int
i;
for(
i=0;i<5;i++)
{
if(stu[i].sex=‘M’)
printf("%d"
,stu[i].num);
return
0;
}
for( i=0;i<5;i++)
{
if(stu[i].score>90)
printf("%d",
stu[i].score);
return
0;
}
}