C # insert sorting and semi-sorting algorithms

C # Sorting Algorithm

// Insert sorting

Public class insertsort
{
Static void main2 ()
{
Int [] Number = {30, 25, 65, 17, 99,12, 33, 9,200, 2, 60 };
Int TMP;
For (INT I = 1; I <= number. Length-1; I ++)
{
If (number [I] <number [I-1])
{
TMP = number [I];
Int J = I-1;
For (; j> = 0 & number [J]> TMP; j --)
{
Number [J + 1] = number [J];
}
Number [J + 1] = TMP;
}
}

For (INT I = 0; I <number. length; I ++)
Console. writeline (number [I]);
Console. Read ();
}
}

// Semi-order
Public class halfsort
{
Static void main ()
{
Int [] Number = {30, 25, 65, 17, 99,12, 9, 33,200, 2, 60 };
Int TMP;
For (INT I = 1; I <= number. Length-1; I ++)
{
TMP = number [I];
Int low = 0;
Int high = I-1;
While (low <= high)
{
Int Pos = (low + high)/2;
If (TMP <number [POS])
High = pos-1;
Else
Low = POS + 1;
}
For (Int J = I-1; j> high; j --)
Number [J + 1] = number [J];
Number [high + 1] = TMP;
}
For (INT I = 0; I <number. length; I ++)
Console. writeline (number [I]);
Console. Read ();
}
}