Several Simple sorting algorithms

// Bubble sort
Public static void PopSort (int [] arry)
{
For (int I = 0; I <arry. Length-1; I ++)
{
For (int j = I; j <arry. Length-1; j ++)
{
If (arry [I]> arry [j + 1])
{
Int temp = 0;
Temp = arry [I]; arry [I] = arry [j + 1]; arry [j + 1] = temp;
}
}
}
}
// Select sorting
Public static void SelectSort (int [] arry)
{
Int temp = 0, min = 0; // min stores the minimum subscript. arry [min] is the minimum value.
For (int I = 0; I <arry. Length; I ++)
{
Min = I; // The initial minimum value is an integer arry [I].
// Traverse the array, locate the minimum value, and assign the value to min
For (int j = I + 1; j <arry. Length; j ++)
{
If (arry [j] <arry [min])
{
Min = j;
}
}
// Move the minimum value arry [min] to the initial minimum value location arry [I]
Temp = arry [I];
Arry [I] = arry [min];
Arry [min] = temp;
}
}
// Insert sorting
Public static void InsertSort (int [] arry)
{
Int min = 0, temp = 0;
For (int I = 0; I <arry. Length; I ++)
{
Temp = arry [I];
Min = I;
While (min> 0 & arry [min-1]> temp)
{
Arry [min] = arry [min-1];
Min --;
}
Arry [min] = temp;
}
}