冒泡算法:
private void BubbleSort(int[] arr)
{
if (arr.Length < 1)
return;
for (int i = 0; i < arr.Length; i++)
{
for (int j = i + 1; j < arr.Length; j++)
{
if (arr[i] > arr[j])
{
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
选择排序:
private void SelectSort(int[] arr)
{
for (int i = 0; i < arr.Length - 1; i++)
{
int index = i;
for (int j = i + 1; j < arr.Length; j++)
{
if (arr[index] > arr[j])
{
index = j;
}
}
if (index != i)
{
int temp = arr[index];
arr[index] = arr[i];
arr[i] = temp;
}
}
}
插入排序:
private void InsertSort(int[] arr)
{
int j;
for (int i = 1; i < arr.Length; i++)
{
int temp = arr[i];
for (j = i - 1; j >= 0 && temp < arr[j]; j--)
{
arr[j + 1] = arr[j];
}
arr[j + 1] = temp;
}
}