对数组int[] i = { 1, 7, 8, 5, 2, 6, 9, 4, 3, 0 };进行冒泡排序
案例1:
#region 冒泡
#region 冒泡排序例一
//定义数组
int[] i = { 1, 7, 8, 5, 2, 6, 9, 4, 3, 0 };
Console.WriteLine("排序前的数组:");
//循环遍历输出未排序方法
for (int x = 0; x < i.Length; x++)
{
Console.Write(i[x] + " ");
}
Console.WriteLine("");
Console.WriteLine("排序后的数组:");
Bubbl(i);
}
public static void Bubbl(int[] arry)
{
//外层循环遍历i
for (int i = 0; i < arry.Length; i++)
{
//内层循环遍历j,
for (int j = i + 1; j < arry.Length; j++)
{
//比较数组元素大小,并进行交换位置
if (arry[i] < arry[j])
{
//定义个变量进行交换位置。
int emp = arry[i];//将arry[i]的值赋给变量
arry[i] = arry[j];//将arry[j]的值赋给arry[i]
arry[j] = emp;//将emp里存放的i的值赋给arry[j]
}
}
}
//交换位置之后,循环一次输出
for (int i = 0; i < arry.Length; i++)
{
Console.Write(i + " ");
}
}
运行结果如图:
案例2:
#region 冒泡排序例二
int temp = 0;
int[] arr = { 23, 44, 66, 76, 98, 11, 3, 9, 7 };
Console.WriteLine("排序前的数组:");
foreach (int item in arr)
{
Console.Write(item + " ");
}
Console.WriteLine();
for (int i = 0; i < arr.Length - 1; i++)
{
//region将大的数字移到数组的arr.Length-1-i
for (int j = 0; j < arr.Length - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
}
Console.WriteLine("排序后的数组:");
foreach (int item in arr)
{
Console.Write(item + " ");
}
Console.WriteLine();
Console.ReadKey();
#endregion
运行如图所示: