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

                g.DrawString(mid.ToString(), Font, b, new PointF(120, 280));

                g.DrawString(X2.ToString(), Font, b, new PointF(120, 300));

            }

        }

        public double midNumber()

        {

            tmp = 0;

            for (i = 0; i < arr.Length; i++)

            {

                tmp += arr[i];

            }

            tmp /= arr.Length;

            return tmp;

        }

        public double[] dataCount()

        {

            tmparr = new double[8] { 0, 0, 0, 0, 0, 0, 0, 0 };

            for (i = 0; i < r; i++)

            {

                for (j = 0; j < arr.Length; j++)

                {

                    if (arr[j] >= inter[i, 0])

                        if (arr[j] <= inter[i, 1])

                            tmparr[i]++;

                }

            }

            return tmparr;

        }

        public double arrMax(double[] ar)

        {

            double mMax = 0;

            for (i = 0; i < ar.Length; i++)

            {

                if (mMax < ar[i])

                    mMax = ar[i];

            }

            return mMax;

        }

        public double arrMin(double[] ar)

        {

            double mMin = arrMax(arr);

            for (i = 0; i < ar.Length; i++)

            {

                if (mMin > ar[i])

                    mMin = ar[i];

            }

            return mMin;

        }

        public void bubblesort()

        {

            double tmp = 0;

            for (i = 0; i <= arr.Length - 1; i++)

            {

                for (j = 0; j <= arr.Length - 2 - i; j++)

                {

                    if (arr[j] > arr[j + 1])

                    {

                        tmp = arr[j];

                        arr[j] = arr[j + 1];

                        arr[j + 1] = tmp;

                    }