C#冒泡排序的实现,代码如下,都是自己敲的。。
int[] a = new int[] { 54, 46, 465, 132, 89, 321, 48, 5, 132, 645, 4, 64, 654, 64, 6456, 65, 4, 68 };
for (int i = 0; i < a.Length-1; i++)
{
for (int j = 0; j < a.Length-1-i; j++)
{
if (a[j] < a[j + 1])
{
int b = a[j];
a[j] = a[j + 1];
a[j + 1] = b;
}
}
}
foreach (int c in a)
{
Console.WriteLine(c);
}