c# insertion sort

gistfile1.cs

static void InsertSort<T>(T[] array) where T : IComparable<T>
        {
            int i, j;

            for (i = 1; i < array.Length; i++)
            {
                T value = array[i];
                j = i - 1;
                while ((j >= 0) && (array[j].CompareTo(value) > 0))
                {
                    array[j + 1] = array[j];
                    j--;
                }
                array[j + 1] = value;
            }
        }