实验5
task1.1
#include<stdio.h> #define N 5 void input(int x[],int n); void output(int x[],int n); void find_min_max(int x[], int n, int *pmin, int *pmax); int main() { int a[N]; int min ,max; printf("录入%d个数据:\n",N); input(a,N); printf("数据是:\n"); output(a,N); printf("数据处理...\n"); find_min_max(a,N,&min,&max); printf("输出结果:\n"); printf("min = %d,max = %d\n",min,max); return 0; } void input(int x[], int n){ int i; for(i=0;i<n;++i) scanf("%d",&x[i]); } void output(int x[], int n){ int i; for(i=0;i<n;++i) printf("%d",x[i]); printf("\n"); } void find_min_max(int x[],int n, int *pmin, int *pmax){ int i; *pmin = *pmax = x[0]; for(i=0;i<n;++i) if(x[i]<*pmin) *pmin = x[i]; else if(x[i]>*pmax) *pmax = x[i]; }

task1.2
#include<stdio.h> #define N 5 void input(int x[],int n); void output(int x[],int n); int *find_max(int x[], int n); int main() { int a[N]; int *pmax; printf("录入%d个数据:\n",N); input(a,N); printf("数据是:\n"); output(a,N); printf("数据处理...\n"); find_max(a,N); printf("输出结果:\n"); printf("max = %d\n",*pmax); return 0; } void input(int x[], int n){ int i; for(i=0;i<n;++i) scanf("%d",&x[i]); } void output(int x[], int n){ int i; for(i=0;i<n;++i) printf("%d",x[i]); printf("\n"); } int *find_max(int x[],int n){ int max_index = 0; int i; for(i=1;i<n;++i){ if(x[i]>x[max_index]) max_index = i; } return &x[max_index]; }
task2.1
#include<stdio.h> #include<string.h> #define N 80 int main() { char s1[] = "Learning makes me happy"; char s2[] = "Learning makes me sleepy"; char tmp[N]; printf("sizeof(s1)vs. strlen(s1):\n"); printf("sizeof(s1) = %d\n",sizeof(s1)); printf("strlen(s1) = %d\n",strlen(s1)); printf("\nbefore swap:\n"); printf("s1:%s\n",s1); printf("s2:%s\n",s2); printf("\nswapping...\n"); strcpy(tmp,s1); strcpy(s1,s2); strcpy(s2,tmp); printf("\nafter swap:\n"); printf("s1:%s\n",s1); printf("s2:%s\n",s2); return 0; }

task 2.2
#include<stdio.h> #include<string.h> #define N 80 int main() { char *s1 = "Learning makes me happy"; char *s2 = "Learning makes me sleepy"; char *tmp; printf("sizeof(s1)vs. strlen(s1):\n"); printf("sizeof(s1) = %d\n",sizeof(s1)); printf("strlen(s1) = %d\n",strlen(s1)); printf("\nbefore swap:\n"); printf("s1:%s\n",s1); printf("s2:%s\n",s2); printf("\nswapping...\n"); tmp = s1; s1 = s2; s2 = tmp; printf("\nafter swap:\n"); printf("s1:%s\n",s1); printf("s2:%s\n",s2); return 0; }

task 3
#include<stdio.h> int main() { int x[2][4] = {{1,9,8,4},{2,0,4,9}}; int i,j; int *ptr1; int (*ptr2)[4]; printf("输出1:使用数组名、下标直接访问二维数组元素\n"); for(i=0;i<2;++i){ for(j=0;j<4;++j) printf("%d",x[i][j]); printf("\n"); } printf("\n输出2:使用指向元素的指针向量p间接访问二维数组元素\n"); for(ptr1 = &x[0][0],i = 0;ptr1<&x[0][0]+8;++ptr1,++i){ printf("%d",*ptr1); if((i + 1)%4 == 0) printf("\n"); } printf("\n输出3:使用指向一位数组的指针向量q间接访问二维数组元素\n"); for(ptr2 = x;ptr2<x+2;++ptr2){ for(j = 0;j<4;++j) printf("%d",*(*ptr2+j)); printf("\n"); } return 0; }

task 4.1
#include<stdio.h> #define N 80 void replace(char *str, char old_char, char new_char); int main() { char text[N] = "c programming is difficult or not, it is a question."; printf("原始文本:\n"); printf("%s\n",text); replace(text,'i','*'); printf("处理后文本:\n"); printf("%s\n",text); return 0; } void replace(char *str, char old_char, char new_char){ int i; while(*str){ if(*str==old_char) *str = new_char; str++; } }

task4.2
#include<stdio.h> #define N 80 void str_trunc(char *str, char x); int main() { char str[N]; char ch; printf("输入字符:"); gets(str); printf("输入一个字符:"); ch = getchar(); printf("截断处理...\n"); str_trunc(str,ch); printf("截断处理后的字符串:%s\n",str); return 0; } void str_trunc(char *str, char x){ while(*str){ if(*str==x) *str = '\0'; *str++; } }

task 5.1
#include<stdio.h> #include<string.h> void sort(char*name[], int n); int main() { char *course[4] = {"C Program", "C++ Object Oriented Program", "Operating System", "Data Structure and Algorithms"}; int i; sort(course,4); for(i = 0;i<4;++i) printf("%s\n",course[i]); return 0; } void sort(char *name[], int n){ int i,j; char *tmp; for(i = 0;i<n;++i) for(j = 0;j<n-1-i;++j) if(strcmp(name[j],name[j+1])>0){ tmp = name[j]; name[j] = name[j+1]; name[j+1] = tmp; } }

task 5.2
#include<stdio.h> #include<string.h> void sort(char*name[], int n); int main() { char *course[4] = {"C Program", "C++ Object Oriented Program", "Operating System", "Data Structure and Algorithms"}; int i; sort(course,4); for(i = 0;i<4;++i) printf("%s\n",course[i]); return 0; } void sort(char *name[], int n){ int i,j,k; char *tmp; for(i = 0;i<n-1;++i){ k = i; for(j = i+1;j<n;++j) if(strcmp(name[j],name[k])<0) k = j; if(k!=i) { tmp = name[i]; name[i] = name[k]; name[k] = tmp; } } }

task 6
#include<stdio.h> #include<string.h> #define N 5 int check_id(char *str); int main() { char *pid[N] = {"31010120000721656X", "330106199609203301", "53010220051126571", "510104199211197977", "53010220051126133Y"}; int i; for(i = 0;i<N;++i) if(check_id(pid[i])) printf("%s\tTrue\n",pid[i]); else printf("%s\tFalse\n",pid[i]); return 0; } int check_id(char *str){
int i;
if(strlen(str)!=18){
return 0;
}
for(i=0;i<17;++i){
if(str[i]<'0'||str[i]>'9'){
return 0;
}
}
if(str[17]<'0'||(str[17]>'9'&&str[17]<'X')||str[17]>'X'){
return 0;
}
}

1 #include <stdio.h> 2 #define N 80 3 void encoder(char *str); // 函数声明 4 void decoder(char *str); // 函数声明 5 6 int main() { 7 char words[N]; 8 9 printf("输入英文文本: "); 10 gets(words); 11 12 printf("编码后的英文文本: "); 13 encoder(words); // 函数调用 14 printf("%s\n", words); 15 16 printf("对编码后的英文文本解码: "); 17 decoder(words); // 函数调用 18 printf("%s\n", words); 19 20 return 0; 21 } 22 23 /*函数定义 24 功能:对s指向的字符串进行编码处理 25 编码规则: 26 对于a~z或A~Z之间的字母字符,用其后的字符替换; 其中,z用a替换,Z用A替换 27 其它非字母字符,保持不变 28 */ 29 void encoder(char *str) { 30 int i=0; 31 while(str[i]!='\0'){ 32 if(str[i]>='a'&&str[i]<'z'||str[i]>='A'&&str[i]<'Z'){ 33 str[i]++; 34 } 35 else if(str[i]=='z'||str[i]=='Z'){ 36 str[i]-=25; 37 } 38 ++i; 39 } 40 } 41 42 /*函数定义 43 功能:对s指向的字符串进行解码处理 44 解码规则: 45 对于a~z或A~Z之间的字母字符,用其前面的字符替换; 其中,a用z替换,A用Z替换 46 其它非字母字符,保持不变 47 */ 48 void decoder(char *str) { 49 int i=0; 50 while(str[i]!='\0'){ 51 if(str[i]>'a'&&str[i]<='z'||str[i]>'A'&&str[i]<='Z'){ 52 str[i]--; 53 } 54 else if(str[i]=='a'||str[i]=='z'){ 55 str[i]+=25; 56 } 57 ++i; 58 } 59 }


浙公网安备 33010602011771号