C#实现冒泡排序法
public static int[] BubbleSort(int[] listNumber)
{
try
{
if (listNumber != null && != 0)
{
bool flag;
int temp;
for (int i = 0; i < - 1; i++)
{
flag = false;
for (int j = 0; j < - i - 1; j++)
{
if (listNumber[j] > listNumber[j + 1])
{
temp = listNumber[j];
listNumber[j] = listNumber[j + 1];
listNumber[j + 1] = temp;
flag = true;
}
}
if (!flag)
{
break;
}
}
return listNumber;
}
else
{
return null;
}
}
catch (Exception ex)
{
//异常处理(代码省略)
return null;
}
}