C # algorithm-select sorting

Code
Using System;
Using System. Collections. Generic;
Using System. text;

Namespace Sortalgorithm
{
Class Selectionsort
{
Private   Static   Int Min;
Public   Static   Void Sort ( Int [] Data)
{
For ( Int I =   0 ; I < Data. Length -   1 ; I ++ )
{
Min = I;
For ( Int J = I +   1 ; J < Data. length; j ++ )
{
If (Data [J] < Data [Min])
Min = J;
}
Int T = Data [Min];
Data [Min] = Data [I];
Data [I] = T;
}
}
Static   Void Main2 ()
{
Int [] = { 10 , 1 , 2 , 12 , 34 , 23 , 56 , 67 , 4 , 11 }; // The basic idea is: in the first round of comparison, the minimum number is obtained first, and the realization is that the two numbers are switched by position.
Selectionsort. Sort ();
For ( Int M =   0 ; M < A. length; m ++ )
Console. Write ( " {0} " , A [m]);
Console. Read ();
}
}
}