Insertion Sort Coding in C#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, -4, 11, 0, 18, 22, 67, 51,6};Console.WriteLine(“nOriginal Array Elements :”);PrintIntegerArray(numbers);Console.WriteLine(“nSorted Array Elements :”);PrintIntegerArray(InsertionSort(numbers));Console.WriteLine(“n”);}static int[] InsertionSort(int[] inputArray){for (int i = 0; i 0; … Continue reading “System.Collections.Generic | My Assignment Tutor”
Insertion Sort Coding in C#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, -4, 11, 0, 18, 22, 67, 51,6};Console.WriteLine(“nOriginal Array Elements :”);PrintIntegerArray(numbers);Console.WriteLine(“nSorted Array Elements :”);PrintIntegerArray(InsertionSort(numbers));Console.WriteLine(“n”);}static int[] InsertionSort(int[] inputArray){for (int i = 0; i 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 0; j–){if (inputArray[j – 1] > insertionValue){inputArray[j] = inputArray[j – 1];}}inputArray[j] = insertionValue;}return inputArray;}}}Flowchart
