#include <stdio.h>
#include <math.h>

#define DATA_N 10
//-----------------------------------------------------------------
void swapvalue(double *v1,double *v2);
void simple_sort(double* a,int n);
double calc_sd(double* a,int n);
double calc_mean(double* a,int n);
//-----------------------------------------------------------------

int main()
{
    int i;
    double a[DATA_N];
    // input datas
    printf("input %ds value:\n",DATA_N);
    for(i=0;i<DATA_N;i++){
        printf("[%d]:",i+1);
        scanf("%lf",&a[i]);
    }
    simple_sort(a,DATA_N);
    // display
    printf("max  value = %lf\n",a[DATA_N-1]);
    printf("min  value = %lf\n",a[0]);
    printf("mean value = %lf\n",calc_mean(a,DATA_N));
    printf("SD   value = %lf\n",calc_sd(a,DATA_N));
    return 0;
}
//-----------------------------------------------------------------
// Swap values
//-----------------------------------------------------------------
void swapvalue(double *v1,double *v2)
{
    double tmp=*v2; *v2=*v1; *v1=tmp;
}
//-----------------------------------------------------------------
// Simple Sorting Algorithm
//-----------------------------------------------------------------
void simple_sort(double* a,int n)
{
    int i,j;
    for(i=0;i<n;i++) for(j=i;j<n;j++){
        if(a[j]<a[i]) swapvalue(&a[j],&a[i]);
    }
}
//-----------------------------------------------------------------
// Calc Standard Deviation
//-----------------------------------------------------------------
double calc_sd(double* a,int n)
{
    int i;
    double mean=calc_mean(a,n);
    double sd=0;
    for(i=0;i<n;i++) sd += pow(a[i]-mean,2);
    sd/=(double)n;
    return sqrt(sd);
}
//-----------------------------------------------------------------
//  Calc mean value
//-----------------------------------------------------------------
double calc_mean(double* a,int n)
{
    int i;
    double mean=0;
    for(i=0;i<n;i++) mean += a[i];
    mean/=n;
    return mean;
}