C# program to sorts its argument (destructively) using insert sort

 using System;  
 using System.Collections.Generic;  
 using System.Linq;  
 using System.Text;  
 using System.Threading.Tasks;  
 public class Main  
 {  
   /// <summary> Sorts its argument (destructively) using insert sort; in the context of this package  
   /// insertion sort is simple and efficient given its relatively small inputs.  
   ///   
   /// </summary>  
   /// <param name="vector">vector to sort  
   /// </param>  
   /// <param name="comparator">comparator to define sort ordering  
   /// </param>  
   public static void insertionSort(List<Object> vector, Comparator comparator)  
   {  
     int max = vector.Count;  
     for (int i = 1; i < max; i++)  
     {  
       Object value_Renamed = vector[i];  
       int j = i - 1;  
       Object valueB;  
       while (j >= 0 && comparator.compare((valueB = vector[j]), value_Renamed) > 0)  
       {  
         vector[j + 1] = valueB;  
         j--;  
       }  
       vector[j + 1] = value_Renamed;  
     }  
   }  
 }