第1个回答 2008-08-24
动态分配,用链表好象分少了点.先给个稚形
struct student {
char name[20];
int score;
}
不用链表:
int getstu(int *max,int *min,int *avg,int *overavg,int *arr int n){
int i,j,sum;
*overavg=0;
sum=0;
*max=0;
*min=101;
for(i=0;i<n;i++){
if(arr[i]>*max)
*max=arr[i];
if(*min>arr[i])
*min=arr[i];
sum+=arr[i];
}
*avg=sum/n;
for(i=0;i<n;i++){
if(arr[i]>*avg)
*overavg++;
}
}