An implementation of insertion sort in C#.

InsertionSort.cs

using System.Collections.Generic;
 
public class InsertionSort
{
    public void Sort<T>(IList<T> items)
    {
        for (var i = 1; i < items.Count; i++)
        {
            int j;
            var left = items[i];
            var code = left.GetHashCode();
            for(j = i - 1; j >= 0 && (items[j].GetHashCode() > code); j--)
            {
                items[j + 1] = items[j];
            }
            items[j + 1] = left;
        }
    }
}