using System;
namespace 冒泡排序法
{
class Class1
{
public static void Main()
{
int temp;
int[] array = new int[5]{23,5,6,677,1};
for( int i = array.Length; i > 0; i--)
for( int j = 0; j < i-1; j++)
{
if( array[j] > array[j+1])
{
temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
for(int k = 0; k < array.Length; k++)
Console.WriteLine(array[k]);
}
}
}
