您的位置:首页 > 理论基础 > 数据结构算法

数据结构极值及平均值

2016-03-20 17:14 537 查看
#include<malloc.h>
#include<stdio.h>
#define maximum 100
void CreateSequence(double *sequence,int len)
{
double value;
int count;
printf("please input\n");
for(count = 0;count<len;count++)
{
scanf("%lf",&value);
sequence[count]=value;
}
}
void SequenceMaxMin(double *sequence,int len,double *max,double *min)
{
int i;
*max = sequence[0];
*min = sequence[0];
for(i =1;i<len;i++)
{
if(*max<sequence[i])
*max = sequence[i];
if(*min>sequence[i])
*min = sequence[i];

}
return;
}
int SequenceMean(double *sequence, int len)
{
int i;
double num = 0;
for(i =0; i<len;i++)
num = num+sequence[i];

return (num/len);
}
void main()
{
double sequence[maximum];
int len = 10;
double max,min;
printf("please enter data:\n");
CreateSquence(sequence,len);
printf("the mean value is %lf\n",SequenceMean(sequence,len));//这处错误,应改为n = SequenceMean(sequence, len);//
SequenceMaxMin(sequence,len,&max,&min);
printf("the maxmimum value is %lf\n",max);
printf("the minimun value is %lf\n",min);
}


函数声明需在MAIN之前
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息