新手冒泡排序 :
static void Sort(int[] arr)
{
for (int i = 0; i < arr.Length-1; i++)
{
for (int j = 0; j < arr.Length - 1-i; j++)
{
if (arr[i] > arr[i + 1])
{
int num = arr[i + 1];
arr[i + 1] = arr[i];
arr[i] = num;
}
}
}
}
优化冒泡排序:
static void Sort(int[] arr)
{
bool isChange = false;
int maxNum = 0;
do
{
isChange = false;
for (int i = 0; i < arr.Length-1-maxNum; i++)
{
if (arr[i]>arr[i+1])
{
int num = arr[i + 1];
arr[i + 1] = arr[i];
arr[i] = num;
isChange = true;
}
}
maxNum++;
} while (isChange);
}