科大C语言数组大作业(3)

}

{ }

aver=((double)sum)/n; return aver;

sum+=arr[i];

int Max(intarr[],int n)//求最大值 { }

int Min(intarr[],int n)//求最小值 {

inti,min_=arr[0]; for(i=0;i

return max_;

if(arr[i]>max_) max_=arr[i];

}

{ }

return min_;

if(arr[i]

double fangcha(intarr[],int n)//求方差 {

double average=aver(arr,n); double fangcha_=0; inti;

for(i=0;i

double junfangcha(intarr[],int n)//求均方差 {

{ }

fangcha_=fangcha_/n; return fangcha_;

fangcha_+=(arr[i]-average)*(arr[i]-average);

}

double junfangcha_;

junfangcha_=pow(fangcha(arr,n),0.5); return junfangcha_;

void xuanze_paixu(intarr[],int n)//选择排序 { }

inti,j,temp,min; for(i=0;i

min=i;

for(j=i+1;j

if(arr[min]>arr[j])

min=j;

if(min!=i) { }

temp=arr[i]; arr[i]=arr[min]; arr[min]=temp;

void putongchazhao(intarr[],intn,int n0) { }

void erfenchazhao(intarr[],intk,int n) {

int low=0,high=n-1;

int mid;

while(low<=high) { inti;

for(i=0;i

printf(\找到元素，下标为%d\\n\if(arr[i]==n0)

break;

if(i==n) { }

printf(\未找到元素\\n\

}

}

mid=(low+high)/2; if(k>arr[mid])

low=mid+1;

else if(k

high=mid-1;

else break;

if(low<=high) printf(\找到元素，下标为:%d\\n\else printf(\未找到\\n\

void josephus(int die[],intn,intm,int s) {

inti,n0; int sum;

for(i=0;i

die[i]=0;

i=sum=0;

for(n0=s;sum

if(die[n0]==0)

i++;