冒泡是数组中的最大数每次循环冒出
代码示例
static void Main(string[] args)
{
int temp = 0;
int[] array = { 8, 9, 1, 5, 2 };
for (int i=0;i<array.Length-1;i++)
{
for(int j = 0; j < array.Length - 1 - i; j++)
{
if (array[j]<array[j+1])
{
temp= array[j+1];
array[j + 1] = array[j];
array[j] = temp;
//Console.WriteLine("{0}", array);
}
}
//Console.WriteLine("{0}", array);
}
foreach(int item in array)
{
Console.WriteLine(item );
}
Console.ReadLine();
}
结果图