#include <stdio.h>#include <stdlib.h>#define N 10int cmp(const void *a,const void *b){??? return *(int*)b - *(int*)a;}int Sum(int score[]){??? int s = 0,i;??? for(i = 0 ; i < N ; i++)??????? s += score[i];??? return s;}int Max(int score[]){??? return score[0];}int Min(int score[]){??? return score[N-1];}double Avg(int s){??? return (s + 0.0) / N;}int main(){??? int score[N]={67,98,75,63,82,79,81,91,66,84};??? int i,sum;??? sum = Sum(score);??? qsort(score,N,sizeof(int),cmp);//sort it??? printf("Total score : %d\n",sum);??? printf("Max score : %d\n",Max(score));??? printf("Min Score : %d\n",Min(score));??? printf("Average score : %f\n",Avg(sum));??? printf("\n成績(jī)排序:\n");??? for(i = 0 ; i < N ; i++)??? {??????? printf("Rank %d's score : %d\n",i+1,score[i]);??? }??? return 0;}
1 回答
已采納
MinRam
TA貢獻(xiàn)87條經(jīng)驗(yàn) 獲得超24個(gè)贊
#include?<stdio.h>
#include?<stdlib.h>
#define?N?10
int?cmp(const?void?*a,const?void?*b){??//?qsort庫(kù)函數(shù)的自定義比較函數(shù)參數(shù)。
????return?*(int*)b?-?*(int*)a;????????//?即進(jìn)行快速排序時(shí)候，比較兩個(gè)元素的先后順序。
}??????????????????????????????????????//?詳情可以看下qsort庫(kù)函數(shù)的參數(shù)介紹（百度）
int?Sum(int?score[]){
????int?s?=?0,i;
????for(i?=?0?;?i?<?N?;?i++)
????????s?+=?score[i];
????return?s;
}
int?Max(int?score[]){
????return?score[0];
}
int?Min(int?score[]){
????return?score[N-1];
}
double?Avg(int?s){
????return?(s?+?0.0)?/?N;
}
int?main()
{
????int?score[N]={67,98,75,63,82,79,81,91,66,84};
????int?i,sum;
????sum?=?Sum(score);
????qsort(score,N,sizeof(int),cmp);????????????????????//?借用庫(kù)函數(shù)快速排序，進(jìn)行數(shù)組排序。
????printf("Total?score?:?%d\n",sum);
????printf("Max?score?:?%d\n",Max(score));
????printf("Min?Score?:?%d\n",Min(score));
????printf("Average?score?:?%f\n",Avg(sum));
????printf("\n成績(jī)排序:\n");
????for(i?=?0?;?i?<?N?;?i++)
????{
????????printf("Rank?%d's?score?:?%d\n",i+1,score[i]);
????}
????return?0;
}
- 1 回答
- 0 關(guān)注
- 1044 瀏覽
添加回答
舉報(bào)
0/150
提交
取消