public void BubbleSort(int[] s)
{
int tmp = 0;
bool swap;
for (int i = 0; i < s.Length; i++)
{
swap = false;
for (int j = 0; j < s.Length - 1 - i; j++)
{
if (s[j] > s[j + 1])
{
tmp = s[j];
s[j] = s[j + 1];
s[j + 1] = tmp;
swap = true;
}
}
if (!swap)
return;
}
}
一.冒泡排序
最新推荐文章于 2024-07-20 22:33:40 发布