Question

C sharp code/ INSERTION SORT of 100 random numbers/ run code for 10 times/determine each time in miliseconds with using stopwatch/ find average time in miliseconds.

Answer 1

Insertion sort using c#:

using System;
  
public class InsertionSort {
  
  
public void sort(int[] arr)
{
int n = arr.Length;
for (int i = 1; i < n; ++i) {
int key = arr[i];
int j = i - 1;
  

while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
  
  
public static void printArray(int[] arr)
{
int n = arr.Length;
      
for (int i = 0; i < n; ++i)
Console.Write(arr[i] + " ");
  
Console.Write("\n");
}
  
  
public static void Main()
{
       Console.WriteLine("Enter array size");
       int n=Convert.ToInt32(Console.ReadLine());
       int [] arr= new int[n];
       Console.WriteLine("Enter array");
       String []numbers = Console.ReadLine().Split(' ');
       for(int i=0;i<arr.Length;i++)
       {
           arr[i] = Convert.ToInt32(numbers[i]);
       }
       Console.WriteLine("Numbers entered are:");
       printArray(arr);
InsertionSort ob = new InsertionSort();
ob.sort(arr);
       Console.WriteLine("Numbers after sorting are:");
printArray(arr);
}
}

After running this code for 10 times for 100 numbers , the running time is as follows:

(42,47,41,45,45,42,41,45,46,41) ms

and the average time is:43.5 ms.