import java.io.*;
import java.util.Scanner;

public class project8
{
    public static void main(String[] args)
    throws FileNotFoundException
    {
        System.out.printf("Fall 2019   Project 8   Due 11/14/19   by Ryan Smith%n");
        Scanner input = new Scanner(new File("data8a.txt"));
        PrintWriter output = new PrintWriter("output.txt");
        double[] data = new double[200];
        int num = readArray(input, data);
        double mean = calcMean(data, num);
        PrntArray(output, data, num, 8);
        double middle = calcMedian(data, num);
        double stdDev = calcStdDev(data, num, mean);
        output.printf("%n There are  %d numbers in the array with a mean of %.2f, median of %.2f, and a standard deviation of %.2f%n", num, mean, middle, stdDev);
        System.out.printf("Sorted numbers%n");
        sort(data, num);
        PrntArray(output, data, num, 9);
        output.close();
    }
    public static int readArray(Scanner file, double data[])
    {
     int num = 0;
     while (file.hasNextLine())
     {
     double next = file.nextDouble();
     data[num] = next;
     num++;
        }
     return num;
    }
    public static double calcMean(double a[], int num)
    {
        double mean = 0;
        int sum = 0;
        for (int i = 0; i < num; i++)
        {
        sum += a[i];
        }
        mean = sum/num;

        return mean;
    }
    public static void PrntArray(PrintWriter output, double a[], int num, int ls)
    {
        for (int i = 0; i < num; i++)
        {
            output.printf("%.2f    ", a[i]);
                if (i % ls == 0)
                {
                    output.printf("%n");
                }
        }
    }
    public static double calcMedian(double a[], int num)
    {
        int middle = num/2;
        return a[middle];
    }
    public static double calcStdDev(double a[], int num, double mean)
    {
        double sum = 0;
        double dev = 0;
        for (int i = 0; i < num; i++)
        {
            sum += a[i];
        }
        for (int i = 0; i < num; i++)
        {
           dev += (a[i] - mean) * (a[i] - mean);
        }
        return Math.sqrt(dev-1);
    }
    public static void sort(double a[], int num)
    {
        double placeholder = 0;
        for (int i = 0; i < num; i++)
        {
            for (int k = 0; k < num-1; k++)
            {
                if (a[k] > a[k+1])
                {
                    placeholder = a[k+1];
                    a[k + 1] = a[k];
                    a[k] = placeholder;

                }
            }
        }
        for (int z = 0; z < num; z++)
        {
            System.out.printf("%.2f   %n", a[z]);
        }
    }
}