如下代码，输入一批整数，最多100个，当输入0时，结束输入

Question

用冒泡法将这批整数按从小到大的顺序排列后输出，要求定义三个函数分别进行数组输入、输出和排序。
#include<stdio.h>
#define N 100
void inputarr (int *p,int *n);
void bubblesort(int *arr, int length);
void outputarr (int *p,int n);
void swap(int *a,int *b);

int main()
{
int a[N];
int i,n;
inputarr (a,&n);
bubblesort(a, n); 
outputarr (a, n);
return 0;
}

Answer 1

#include <stdio.h>#define N 100void inputarr(int* p, int* n);void bubblesort(int* arr, int length);void outputarr(int* p, int n);void swap(int* a, int* b);int main(){&nbsp; &nbsp; int a[N];&nbsp; &nbsp; int i, n;&nbsp; &nbsp; inputarr(a, &n);&nbsp; &nbsp; bubblesort(a, n);&nbsp; &nbsp; outputarr(a, n);&nbsp; &nbsp; return 0;}void inputarr(int* p, int* n){&nbsp; &nbsp; int t;&nbsp; &nbsp; for(*n=0;scanf("%d",&t)&&t!=0;(*n)++)&nbsp; &nbsp; &nbsp; &nbsp; *p++=t;}void bubblesort(int* arr, int length){&nbsp; &nbsp; int i,j;&nbsp; &nbsp; for(i=0;i<length-1;++i)&nbsp; &nbsp; &nbsp; &nbsp; for(j=0;j<length-i-1;++j)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if(arr[j]>arr[j+1])&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; swap(arr+j,arr+j+1);}void outputarr(int* p, int n){&nbsp; &nbsp; int i;&nbsp; &nbsp; for(i=0;i<n;++i)&nbsp; &nbsp; &nbsp; &nbsp; printf("%d\n",*p++);}void swap(int* a, int* b){&nbsp; &nbsp; int t;&nbsp; &nbsp; t=*a;&nbsp; &nbsp; *a=*b;&nbsp; &nbsp; *b=t;}&nbsp;

Answer 2

将第一个学生的信息放入一个结构数组a，将另一个学生的信息放入另一个结构数组b，定义一个结构数组c，c=a;a=b;b=c;用printf输出相关信息即可