C#冒泡排序法

int[] array = new int[5] { 1,2,3,4,5};

int temp = 0;
for(int i=0;i<array.length();i++)
{
        for(int j=i+1;j<array.length();j++)

       {

               if(array[j]<array[i])

               {

                    temp = array[i];

                    array[i]=array[j];

                    array[j]=temp;

               }

       }
}