C# 冒泡算法

C# 冒泡算法，改良的冒泡算法，可以提高效率，注意：第一次假如就是順序的話，就直接退出循環。

static void Main(string[] args)
        {
            int[] arrs = {20,21,24,24,56,78,90,20,78,98};
            //數組的定義3種：
            int[] arrs1 = { 1,2,4};
            int[] arrs2=new int[3];
            int[] arrs3 = new int[] {1,3,3,3,3,3,3,4 };
           
            //進行冒泡排序
            //外層循環將最大值放最後
            for (int i = 0; i <arrs.Length-1; i++)
            {
                bool flag=true;  //冒泡排序優化說明：當發現前面已經不在交換，證明已經是有序隊列，故結束整個循環的排序
                //看第一次排序是否已經是有序隊列
                //內層循環將兩兩交換
                for (int j = 0; j< arrs.Length-1-i; j++)
                {
                    flag = true;
                    int temp=0;
                    if ( Convert.ToInt32(arrs[j])> Convert.ToInt32(arrs[j+1]))
                    {
                        temp = arrs[j + 1];
                        arrs[j+1]=arrs[j];
                        arrs[j] = temp;
                        flag = false;
                    }
                }
                if (flag == false)
                {
                    break;
                }
            }
            foreach (var item in arrs)
            {
                Console.Write("{0} ",item);
            }
            Console.ReadKey();
        }