using System.Collections.Generic;
namespace CommonInsertion_Sort
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));
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];
public static void PrintIntergerArray(int[]array)
Console.Write(i.ToString()+ "");
public static int [] InsertionSortByShift(int[] inputArray)
for (int i = 0; i < inputArray.Length - 1; i++)
var insertionValue = inputArray[i];
if (inputArray[j - 1] > insertionValue)
inputArray[j] = inputArray[j - 1];
inputArray[j] = insertionValue;