C#：冒泡排序，已经排好序的优化

public static void BubbleSort(int[] array)
        {
            bool hasExchagend = false;
            for (int i = 0; i < array.Length - 1; i++)
            {
                hasExchagend = false;
                for (int j = 0; j < array.Length - 1 -i; j++)
                {
                    if (array[j] < array[j + 1])
                    {
                        Exchange(ref array[j], ref array[j + 1]);
                        hasExchagend = true;
                    }
                }
                if(!hasExchagend)
                {
                    return;
                }
            }
        }