using System; namespace CommonInsertion_Sort { class Program { static void Main(string[] args) { int[] numbers = new int[12] { 2, 5, -4, 11, 0, 18, 22, 67, 51, 6, 19, 13 }; Console.WriteLine("\nOriginal Array Elements: "); PrintIntegerArray(numbers); Console.WriteLine("\n\nSorted Array Elements: "); PrintIntegerArray(InsertionSort(numbers)); Console.WriteLine("\n"); Console.ReadLine(); } 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]) { int temp = inputArray[j - 1]; inputArray[j - 1] = inputArray[j]; inputArray[j] = temp; } } } return inputArray; } public static void PrintIntegerArray(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; } } }