C# program to sort the array with insertion sort.

 using System;  
 using System.Collections.Generic;  
 using System.Linq;  
 using System.Text;  
 using System.Threading.Tasks;  
 namespace sorting  
 {  
   class Sorting2  
   {  
     static void Main()  
     {  
       var generator = new Random();  
       var data = new int[10];  
       // fill array with random ints in range 10-99  
       for (var i = 0; i < data.Length; ++i)  
       {  
         data[i] = generator.Next(10, 100);  
       }  
       Console.WriteLine("Unsorted array:");  
       Console.WriteLine(string.Join(" ", data) + "\n"); // display array  
       InsertionSort(data); // sort array  
       Console.WriteLine("Sorted array:");  
       Console.WriteLine(string.Join(" ", data) + "\n"); // display array  
       Console.ReadLine();  
     }  
     public static void InsertionSort(int[] values)  
     {  
       // loop over data.Length - 1 elements  
       for (var next = 1; next < values.Length; ++next)  
       {  
         // store value in current element  
         var insert = values[next];  
         // initialize location to place element  
         var moveItem = next;  
         // search for place to put current element  
         while (moveItem > 0 && values[moveItem - 1] > insert)  
         {  
           // shift element right one slot  
           values[moveItem] = values[moveItem - 1];  
           moveItem--;  
         }  
         values[moveItem] = insert; // place inserted element  
         PrintPass(values, next, moveItem); // output pass of algorithm  
       }  
     }  
     public static void PrintPass(int[] values, int pass, int index)  
     {  
       Console.Write($"after pass {pass}: ");  
       // output elements till swapped item  
       for (var i = 0; i < index; ++i)  
       {  
         Console.Write($"{values[i]} ");  
       }  
       Console.Write($"{values[index]}* "); // indicate swap  
       for (var i = index + 1; i < values.Length; ++i)  
       {  
         Console.Write($"{values[i]} ");  
       }  
       Console.Write("\n       "); // for alignment  
                         // indicate amount of array that is sorted  
       for (var i = 0; i <= pass; ++i)  
       {  
         Console.Write("-- ");  
       }  
       Console.WriteLine("\n");  
     }  
   }  
 }