# Проверка гипотезы о нормальности закона распределения экспериментальных данных, страница 3

double[] Zi;        // Zi

double[] Fi;        // f(Zi)

double[] Nteor;     // theory count of number count in the interval

double[] Xi2;

double X2;

double f;           // count of freedom number

int i, j;

double tmp;

double[] tmparr;

public Form1()

{

calculating();

InitializeComponent();

}

public void calculating()

{

arr = new double[80] { 5.674,4.944,4.113,5.451,4.283,

4.033,5.722,4.645,5.054,5.709,

4.189,5.082,4.619,2.848,5.503,

4.191,3.860,3.096,6.254,5.632,

4.956,2.913,5.090,3.325,4.495,

3.229,5.293,3.184,3.436,3.675,

3.347,5.364,2.952,2.813,3.892,

3.459,4.242,5.241,4.639,3.549,

3.845,4.488,5.136,3.452,5.235,

2.871,7.277,4.358,4.947,3.947,

4.714,6.920,3.698,5.416,5.589,

5.474,3.450,4.609,5.640,5.343,

5.800,3.931,7.391,5.832,4.124,

4.066,3.386,7.139,3.767,5.647,

3.877,4.509,4.205,4.478,4.425,

5.345,5.371,1.905,5.321,6.495};

bubblesort();

n = arr.Length;

r = 8;

max = arrMax(arr);

min = arrMin(arr);

step = (max - min) / r;

inter = new double[8, 2];

for (i = 0; i < 8; inter[i, 0] = min + i * step, inter[i, 1] = min + (i + 1) * step, i++) ;

midInter = new double[8];

for (i = 0; i < r; midInter[i] = inter[i, 0] + (inter[i, 1] - inter[i, 0]) / 2, i++) ;

dataC = new double[8];