using System;

​

​

public class MarvellousArray<T>

{

    public T[] arr;

    public MarvellousArray(int size)

    {

        arr=new T[size];

    }

    public void Accept()

    {

        Console.WriteLine("Enter Elemens of Array : ");

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

        {

            string input = Console.ReadLine();

            arr[i]=(T)Convert.ChangeType(input, typeof(T));

        }

    }

    public void Display()

    {

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

        {   

            Console.WriteLine("Element {0} is : {1}",i,arr[i]);

        }

    }

    public void BubbleSort()

    {

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

        {   

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

            {   

                    dynamic a=arr[i];

                    dynamic b=arr[j];

                    if(a > b)

                    {

                        T temp=arr[i];

                        arr[i]=arr[j];

                        arr[j]=temp;

                    }

            }

        }

    }

    public void InsertionSort()

    {

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

        { 

            T key = arr[i]; 

            int j = i - 1; 

            dynamic temp=arr[j];

            while (j >= 0 && temp  > key) 

            { 

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

                j = j - 1; 

            } 

            arr[j + 1] = key; 

        } 

        }

​

​

    public void LinearSearch(T value1)

    {

        int i=0;

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

        { 

            dynamic a=arr[i];

            if(a==value1)

            {

                Console.WriteLine("Element found at pos : "+(i+1));

                break;

            }

        } 

        if(i==arr.Length)

        {

            Console.WriteLine("Element not found");

        }

    }

​

    public void LinearSearchBidirectional(T value1)

    {

        int i=0,j=0;

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

        { 

            dynamic a=arr[i];

            dynamic b=arr[j];

            if(a==value1)

            {

                Console.WriteLine("Element found at pos : "+(i+1));

                break;

            }

            if(b==value1)

            {

                Console.WriteLine("Element found at pos : "+(j+1));

                break;

            }

        } 

        if(i==arr.Length)

        {

            Console.WriteLine("Element not found");

        }

}

​

​

​

     public void SelectionSort() 

    { 

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

        { 

             int min_index= i;

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

            {

                dynamic a=arr[j];

                dynamic b=arr[min_index];

                if (a< b)

                {

                    min_index = j; 

                }

            }

                T temp = arr[min_index]; 

                arr[min_index] = arr[i]; 

                arr[i] = temp; 

        } 

    } 

    public void BinarySearch(T value1)

    {

            int start=0;

            int end=arr.Length-1;

            int mid=0;

            bool flag=false;

            while(flag !=true)

            {

                mid=((start+end)/2);

                dynamic temp=arr[mid];

                if(temp == value1)

                {

                    flag=true;

                    Console.WriteLine("Value found at pos : "+(mid+1));

                }

                if(temp > value1)

                {

                    end=mid-1;

                }

                if(temp < value1)

                {

                    start=mid+1;

                }

            }

            if(flag!=true)

            Console.WriteLine("Value not found  ");

    }

​

}

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Enter the Size of Array");

        int Size=Convert.ToInt32(Console.ReadLine());

        MarvellousArray<int> mobj1=new MarvellousArray<int>(Size);

        mobj1.Accept();

        mobj1.Display();

        mobj1.BubbleSort();

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

        mobj1.Display();

        mobj1.InsertionSort();

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

        mobj1.Display();

        mobj1.SelectionSort();

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

        mobj1.Display();

        Console.WriteLine("Enter Element for Linear search : ");

        int value1=Convert.ToInt32(Console.ReadLine());

        mobj1.LinearSearch(value1);

        Console.WriteLine("Enter Element for Linear Bidirectional  search : ");

        int value2=Convert.ToInt32(Console.ReadLine());

        mobj1.LinearSearchBidirectional(value2);

        Console.WriteLine("Enter Element for Binary   search : ");

        int value3=Convert.ToInt32(Console.ReadLine());

        mobj1.BinarySearch(value3);

        MarvellousArray<double> mobj2=new MarvellousArray<double>(Size);

        mobj2.Accept();

        mobj2.Display();

        mobj2.BubbleSort();

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

        mobj2.Display();

        mobj2.InsertionSort();

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

        mobj2.Display();

        mobj2.SelectionSort();

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

        mobj2.Display();

        Console.WriteLine("Enter Element for Linear search : ");

        double value4=Convert.ToDouble(Console.ReadLine());

        mobj2.LinearSearch(value4);

        Console.WriteLine("Enter Element for Linear Bidirectional  search : ");

        double value5=Convert.ToDouble(Console.ReadLine());

        mobj2.LinearSearchBidirectional(value5);

        Console.WriteLine("Enter Element for Binary   search : ");

        double value6=Convert.ToDouble(Console.ReadLine());

        mobj2.BinarySearch(value6);

    }

}