C # insertion sort and binary sorting algorithm

C # sorting algorithm

Insert sort 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 ();
}
}


Binary sort
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 ();
}
}