冒泡算法的实现
/// <summary>
/// 冒泡算法
/// </summary>
/// <param name="array"></param>
void SubbSort(int[] array)
{
int temp = 0;
for (int i = 0; i < array.Length; i++)
{
for (int j = 0; j < array.Length - 1 - i; j++)
{
if (array[j] > array[j + 1])
{
temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
}