using System;

​

namespace SortingAlgorithms

{

    class Program

    {

        static void Main(string[] args)

        {

            Console.WriteLine("Сонгоно уу: ");

            Console.WriteLine("1: Text Search");

            Console.WriteLine("2: Selection Sort");

            Console.WriteLine("3: Bubble Sort");

            Console.WriteLine("4: Insertion Sort");

            Console.WriteLine("5: Shell Sort");

            int choice = int.Parse(Console.ReadLine());

​

            switch (choice)

            {

                case 1:

                    TextSearch();

                    break;

                case 2:

                    SelectionSort();

                    break;

                case 3:

                    BubbleSort();

                    break;

                case 4:

                    InsertionSort();

                    break;

                case 5:

                    ShellSort();

                    break;

                default:

                    Console.WriteLine("Буруу сонголт");

                    break;

            }

        }

​

        // Case 1: Text Search

        static void TextSearch()

        {

            string text = "health science";

            string pat = "sci";

            Console.WriteLine("Text: " + text);

            Console.WriteLine("Pattern: " + pat);

​

            char[] W = pat.ToCharArray();

            char[] S = text.ToCharArray();

            int i, j, m = W.Length, n = S.Length;

​

            for (i = 0, j = 0; j < m && i < n; i++, j++)

                if (S[i] != W[j]) { i++; j = 0; }

​

            if (j == m)

                Console.WriteLine("Oldloo. {0} dakhi bairlal", i - m);

            else

                Console.WriteLine("Oldsongui");

        }

​

        // Case 2: Selection Sort

        static void SelectionSort()

        {

            int[] array = { 1020, 530, 2560, 40 };

            int array_size = array.Length;

​

            Console.WriteLine("Эрэмбэлэхээс өмнөх массивын элементүүд:");

            foreach (var item in array) Console.WriteLine(item);

​

            for (int j = 0; j < array_size - 1; j++)

            {

                int min_key = j;

                for (int k = j + 1; k < array_size; k++)

                {

                    if (array[k] < array[min_key]) min_key = k;

                }

                int temp = array[min_key];

                array[min_key] = array[j];

                array[j] = temp;

            }

​

            Console.WriteLine("Эрэмбэлсний дараах массивийн элементүүд:");

            foreach (var item in array) Console.WriteLine(item);

        }

​

        // Case 3: Bubble Sort

        static void BubbleSort()

        {

            int[] array = { 1023450, 52340, 20234, 420 };

            int array_size = array.Length;

​

            Console.WriteLine("The array before Bubble Sort is:");

            foreach (var item in array) Console.WriteLine(item);

​

            for (int index = array_size - 2; index >= 0; index--)

            {

                for (int i = 0; i <= index; i++)

                {

                    if (array[i] > array[i + 1])

                    {

                        int temp = array[i];

                        array[i] = array[i + 1];

                        array[i + 1] = temp;

                    }

                }

​

                Console.WriteLine("Array after pass:");

                foreach (var item in array) Console.WriteLine(item);

            }

​

            Console.WriteLine("Finally, The array after Bubble Sort is:");

            foreach (var item in array) Console.WriteLine(item);

        }

​

        // Case 4: Insertion Sort

        static void InsertionSort()

        {

            int[] array = { 100, 55, 99, 50, 40 };

            Console.WriteLine("The array before Insertion Sort is:");

            foreach (var item in array) Console.WriteLine(item);

​

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

            {

                int temp = array[i];

                int k = i - 1;

​

                while (k >= 0 && array[k] > temp)

                {

                    array[k + 1] = array[k];

                    k--;

                }

                array[k + 1] = temp;

            }

​

            Console.WriteLine("The array after Insertion Sort is:");

            foreach (var item in array) Console.WriteLine(item);

        }

​

        // Case 5: Shell Sort

        static void ShellSort()

        {

            int[] numbers = { 500, 4, 65 };

            int array_size = numbers.Length;

​

            Console.WriteLine("Before Shell Sort:");

            foreach (var item in numbers) Console.Write(item + " ");

            Console.WriteLine();

​

            int h = 2;

            while (h > 0)

            {

                for (int i = 0; i < array_size; i++)

                {

                    int temp = numbers[i];

                    int j = i;

                    while ((j >= h) && (numbers[j - h] > temp))

                    {

                        numbers[j] = numbers[j - h];

                        j -= h;

                    }

                    numbers[j] = temp;

                }

​

                if (h / 2 != 0)

                    h /= 2;

                else if (h == 1)

                    h = 0;

                else

                    h = 1;

            }

​

            Console.WriteLine("After Shell Sort:");

            foreach (var item in numbers) Console.Write(item + " ");

            Console.WriteLine();

        }

    }

}

​