C # algorithm ---- (2) Insert sorting

My friends, I recently stepped up writing some C # algorithms. Select an existing sorting item. The insert algorithm is now available.
If you want to improve your C # programming skills, we can discuss with each other.
For example, the following program does not implement polymorphism.
Using System;
Public class InsertionSorter
{
Public void Sort (int [] list)
{
For (int I = 1; I <list. Length; ++ I)
{
Int t = list [I];
Int j = I;
While (j> 0) & (list [J-1]> t ))
{
List [j] = list [J-1];
-- J;
}
List [j] = t;
}

}
}
Public class MainClass
{
Public static void Main ()
{
Int [] iArrary = new int };
InsertionSorter ii = new InsertionSorter ();
Ii. Sort (iArrary );
For (int m = 0; m <= 13; m ++)
Console. WriteLine ("{0}", iArrary [m]);
}
}
It has been compiled and run. This is too simple and I will not detail it.