C# 冒泡排序

int[] A1=new int[]{1,2,3,4,5,6,7,8,9,0,11,12,13,14,15,16,17,18,10};

            int i,j;

            int temp;

            for (i=0;i<A1.Length;i++)

            {
                for(j=i;j<A1.Length;j++)

                {   if(A1[i]>A1[j])

                   {

                      temp=A1[j];

                      A1[j]=A1[i];

                      A1[i]=temp;

                    }

                 }

            }

            for (int h = 0; h < A1.Length; h++)
            {
                listBox1.Items.Add(A1[h]);
            }

 ==程序优化提示：======================================

1、只需要（排序好的后一位为第一个）第一个和第二个比较就可以了，不用第一个和第一个比较！那么改为 j=i+1。

2、只需要倒数第二个和倒数第一个比较可以了，那么改 i<A1.Length-1。

int[] A1=new int[]{1,2,3,4,5,6,7,8,9,0,11,12,13,14,15,16,17,18,10};

            int i,j;

            int temp;

            for (i=0;i<A1.Length-1;i++)

            {
                for(j=i+1;j<A1.Length;j++)

                {   if(A1[i]>A1[j])

                   {

                      temp=A1[j];

                      A1[j]=A1[i];

                      A1[i]=temp;

                    }

                 }

            }

            for (int h = 0; h < A1.Length; h++)
            {
                listBox1.Items.Add(A1[h]);
            }