static void BubbleSort(int[] pole)

        {

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

            {

                for (int j = 0; j < pole.Length - 1; j++)

                {

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

                    {

                        int pom = pole[j];

                        pole[j] = pole[j + 1];

                        pole[j + 1] = pom;

                    }

 

                }

            }

        }

static void SelectSort(int[] pole)

        {

            int min, temp;

            for (int i = 0; i < pole.Length; i++)

            {

                min = i; // pozice min prvku // nalezeni minima

                for (int j = i + 1; j < pole.Length; j++)

                {

                    if (pole[j] < pole[min])

                    {

                        min = j;

                    }

                } // prohozeni prvku

                temp = pole[i];

                pole[i] = pole[min];

                pole[min] = temp;

            }

        }

        static void InsertSort(int[] pole)

        {

            int j, temp;

            for (int i = 1; i < pole.Length; i++)

            {

                temp = pole[i];

                j = i;

                while ((j > 0) && (pole[j - 1] > temp))

                {

                    pole[j] = pole[j - 1];

                    j--;

                } pole[j] = temp;

            }

        }