#include<stdio.h>
#define N 10
void Max(int num[],int i);
void Min(int num[],int i);
void sort(int num[],int i);
 
 
int main()
{
int num[N],i;
float sum=0,average;
for(i=0;i<N;++i)
{
printf("please enter the number that need to be calculate");
printf("\nplease make sure the number is between the 0 and 100\n");
scanf("%d",&num[i]);
}
 
for(i=0;i<N;++i)
{
printf("the number is %d\n",num[i]);
 
 
}
for(i=0;i<N;++i)
{
sum +=num[i];
}
printf("the total value is %.2f\n",sum);
average=(sum/N);
printf("And the average value is %0.2f\n",average);
Max(num,i);
Min(num,i);
sort(num,i);
printf("reorder list of numbers:\n\n");
for(i=0;i<N;++i)
printf("i=%d x=%d\n",i+1,num[i]);
return 0;
 
}
 
void Max(int num[],int i)
{
int max = num[0];
for(i=1;i<N;i++)
{
	if (max<num[i])
		max=num[i];
}
printf("the value of maximum is %d\n",max);
 
return;
}
 
void Min(int num[],int i)
{
int min=num[0];
for(i=1;i<N;i++)
{
	if (min>num[i])
		min=num[i];
}
printf("the value of minimum is %d\n",min);
return;
}
 
void sort(int num[],int i)
{
 
int k,temp;
for(k=0;k<N;k++)
{
	if(num[k]<num[k+1])
	{
		temp=num[k+1];
		num[k+1]=num[k];
		num[k]=temp;
	}
 
	return;
}

void sort(int num[],int i)
{
       int k,k2,temp;
       for (int k=0; k<N-1; k++)
           for (int k2=k; k2<N; k2++)
               if (num[k] > num[k2])
              {
                   temp = num[k];
                   num[k] = num[k2];
                   num[k2] = temp;
               }
      return ;
}

void sort(int num[],int i)
{
	int k,k2,temp;
	for (k=0; k<N-1; k++)
		for (k2=k; k2<N; k2++)
			if (num[k] > num[k2])
			{
				temp = num[k];
				num[k] = num[k2];
				num[k2] = temp;
			}
	return ;
}

void sort(int num[],int i)
{
	int k,k2,temp;
	for (k=0; k<N-1; k++)
		for (k2=k+1; k2<N; k2++)
			if (num[k] > num[k2])
			{
				temp = num[k];
				num[k] = num[k2];
				num[k2] = temp;
			}
	return ;
}

void sort ( int num[], int i )
{
  int k, k2, temp;
  for ( k = 0; k < N - 1; k++ )
    for ( k2 = k + 1; k2 < N; k2++ )
      if ( num[k] > num[k2] )
      {
        temp = num[k];
        num[k] = num[k2];
        num[k2] = temp;
      }
  return ;
}