## 实验7 指针的使用 ### 实验任务 7-1.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210525-1621909167907) 7-2.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210525-1621909513820) 7-3.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210525-1621909893605) 7-4.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210525-1621911361999) 7-5.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210601-1622514478261) 7-6.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210601-1622514643265) 7-7.c 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210601-1622514942469) ### 上机练习 ##### 1、输入三个整数，按由小到大的顺序输出。 - 代码 ```c #include int main() { void swap(int *p1,int *p2); int *p1,*p2,*p3,a,b,c; printf("please enter three number:"); scanf("%d,%d,%d",&a,&b,&c); p1 = &a; p2 = &b; p3 = &c; if(a int main() { int input(int* p1); int a[10]; float getAvg(int* p2); int* p; float avg = 0; p = a; input(p); avg = getAvg(p); printf("%.2f", avg); } int input(int* p1) { int i = 0; printf("请输入十个数字:"); for (i = 0; i < 10; i++, p1++) scanf("%d", p1); } float getAvg(int* p2) { int i = 0; float sum = 0, avg = 0; for (i = 0; i < 10; i++) sum = sum + *(p2++); return avg = sum / 10; } ``` - 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210630-1625038270224) ##### 3、**练习使用排序方法和对本章内容进行复习**。 - 代码 ```c #include int main() { void selectSort(int a[10]); void bubbleSort(int a[10]); int a[10]; int i,j,k,max; for(i=0;i<10;i++) scanf("%d",&a[i]); printf("input number:"); for(i=0;i<10;i++) printf(" %d ",a[i]); printf("\n"); printf("xuan ze cong da dao xiao:"); selectSort(a); printf("mao pao cong xiao dao da:"); bubbleSort(a); return 0; } void selectSort(int a[10]) { int i,k,j,n,max; for(j=0;j<9;j++) { max = j; for(k=j+1;k<10;k++) { if(a[k]>a[max]) { max = k; } } if(j!=max) { n = a[j]; a[j] = a[max]; a[max] = n; } } for(i=0;i<10;i++) printf(" %d ",a[i]); printf("\n"); } void bubbleSort(int a[10]) { int i,j,k,x; for(i=0;i<9;i++) for(j=0;j<9-i;j++) if(a[j]>a[j+1]) { k = a[j+1]; a[j+1] = a[j]; a[j] = k; } for(x=0;x<10;x++) printf(" %d ",a[x]); printf("\n"); } （ ``` - 运行结果截图：![图片描述](https://dn-simplecloud.shiyanlou.com/courses/uid1535328-20210630-1625038479484)

“程序设计基础II”实验报告