Three sorting algorithms

Bubble sort
Public   Static   Void Main (string [] ARGs ){
Int [] = { 1 , 3 , 9 , 4 , 7 , 2 , 8 , 0 , 11 };
For ( Int I = 0 ; I < A. Length - 1 ; I ++ )
For ( Int J = 0 ; J < A. Length - I - 1 ; J ++ )
If (A [J] > A [J + 1 ]) {
A [J] = A [J] + A [J + 1 ];
A [J + 1 ] = A [J] - A [J + 1 ];
A [J] = A [J] - A [J + 1 ];
}
For ( Int I = 0 ; I < A. length; I ++ ){
System. Out. println (A [I]);
}
}

 

Select sorting method
Public   Static   Void Main (string [] ARGs ){
Int [] = { 1 , 3 , 9 , 4 , 7 , 2 , 8 , 0 };
Int Min;
For ( Int I = 0 ; I < A. Length - 1 ; I ++ ){
Min = I;
For ( Int J = I + 1 ; J < A. length; j ++ ){
If (A [J] < A [Min])
Min = J;
}
Int T = A [Min];
A [Min] = A [I];
A [I] = T;
}
For ( Int I = 0 ; I < A. length; I ++ ){
System. Out. println (A [I]);
}
}

 

Insert sorting method
Public   Static   Void Main (string [] ARGs ){
Int [] = { 1 , 3 , 9 , 4 , 7 , 2 , 8 , 0 , 11 , 15 };
For ( Int I = 1 ; I < A. length; I ++ ){
Int T = A [I];
Int F = I;
While (F > 0 && A [F - 1 ] > = T ){
A [F] = A [F - 1 ];
F -- ;
}
A [F] = T;
}
For ( Int I = 0 ; I < A. length; I ++ ){
System. Out. println (A [I]);
}
}