数组的输入,输出,最大值,最小值,查询,均值和排序。注意返回值类型。
#include<stdio.h>
#define N 10
void input(int a[], int n);
void output(int a[], int n);
int maxnum(int a[], int n);
int minnum(int a[], int n);
int find(int a[], int n,int x);
double ave(int a[], int n);
void sort(int a[], int n);
int main()
{
int i=10, x, max,min;
double average;
int array[N];
input(array, i);
max=maxnum(array, i);
printf("The max is %d\n", max);
min=minnum(array, i);
printf("The min is %d\n", min);
average=ave(array, i);
printf("The average is %f\n", average);
sort(array, i);
output(array, i);
printf("\n");
printf("please input x be searched:\n");
scanf("%d", &x);
int pos;
pos = find(array, i, x);
if (pos < i)
{
printf("value=%d,index=%d\n", x, pos);
}
else
{
printf("not present!\n");
}
return 0;
}
void input(int a[], int n)
{
int i;
for (i = 0;i < n;i++)
scanf("%d", &a[i]);
}
void output(int a[], int n)
{
int i;
for (i = 0;i < n;i++)
printf("%d ", a[i]);
}
int maxnum(int a[], int n)
{
int i, max;
max = a[0];
for (i = 0;i < n;i++)
{
if (max < a[i])
{
max = a[i];
}
}
return max;
}
int minnum(int a[], int n)
{
int i, min;
min = a[0];
for (i = 0;i < n;i++)
{
if (min > a[i])
{
min = a[i];
}
}
return min;
}
int find(int a[], int n, int x)
{
int i = 0;
while (i < n)
{
if (x == a[i])
break;
i++;
}
return i;
}
double ave(int a[], int n)
{
double average;
int sum=0, i;
for (i = 0;i < n;i++)
{
sum += a[i];
average = sum / n;
}
return average;
}
void sort(int a[], int n)
{
int i, j, temp;
for(i=0;i<n-1;i++)
for(j=n-1;j>i;j--)
if (a[j] < a[j - 1])
{
temp = a[j - 1];
a[j - 1] = a[j];
a[j] = temp;
}
}