using System;

​

public class Program

{

    public static void selectionSort(int[] arr)

    {

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

        {

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

            {

                if (arr[j] < arr[i])

                {

                    int temp = arr[i];

                    arr[i] = arr[j];

                    arr[j] = temp;

                }

            }

        }

​

        Console.WriteLine("\n");

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

            Console.Write("\t{0}", arr[k]);

    }

​

    public static void insertionSort(int[] arr)

    {

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

        {

            int key = arr[i];

            int j = i - 1;

            //Console.Write("\n i {0}", i); 

            //Console.Write("\t Key {0} \t", key);  

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

            //  Console.Write("{0}-", arr[k]);

            while (j >= 0 && arr[j] > key)

            {

                //Console.Write("\n\t j {0}", j);

                //Console.Write("\t\t\t arr[{1}] {0}", arr[j],j);   

                //Console.Write("\t arr[{1}] {0}", arr[j+1],j+1);   

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

                j = j - 1;

            }

​

            //Console.WriteLine("\n j {0}", j); 

            arr[j + 1] = key;

        }

​

        Console.WriteLine("\n");

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

            Console.Write("\t{0}", arr[k]);

    }

​

    public static void Main()

    {

        int[] arr = {12, 11, 13, 5, 6};

        insertionSort(arr);

        selectionSort(arr);

    }

}