数据结构极值及平均值

#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之前

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值