using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

​

namespace CommonInsertion_Sort

{               

class program

{

    static void Main(string[] args)

    {

        int[] numbers = new int[10] {2, 5, 7, 9, 10};

        Console.WriteLine("\nOriginal array elements :");

        PrintIntergerArray(numbers);

        Console.WriteLine("\nSorted array elements :");

        PrintIntergerArray(InsertionSort(numbers));

        Console.WriteLine("\n");

    }

    static int[] InsertionSort(int[] inputArray)

    {

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

        {

            for (int j = i + 1; j > 0; j--)

            {

                if (inputArray[j-1]> inputArray[j];

                    inputArray[j]= temp;

            }

        }

    }

        return inputArray;

}

                    public static void PrintIntergerArray(int[]array)

                    {

                        foreach (int i in array)

                        {

                            Console.Write(i.ToString()+ "");

                        }

                    }

                    public static int [] InsertionSortByShift(int[] inputArray)

                    {

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

                        {

                            int j;

                            var insertionValue = inputArray[i];

                            for (j = i; j>0; j--)

                            {

                                if (inputArray[j - 1] > insertionValue)

                                {

                                    inputArray[j] = inputArray[j - 1];

                                }

                            }

                            inputArray[j] = insertionValue;

                        }

                        return inputArray;

                    }

                }

​