Bubble sort and its implementation

Bubble sort is quite like the insertion sort. In the insertion sort, the left part of the array is always ordered, which is the same in Bubble sort.

In bubble sort, the adjacent elements are compared and swaped if the higher element is larger than the lower element, and the compare-and-swap procedure will stop when the bubble sort reach the upper bound of the unsorted array.

 class BubbleSortAlgorithm
    {
        public void BubbleSort(int[] array)
        {
           bool exchanged = false; // to check whether the array is sorted. 
           for (int i = 1; i < array.Length; i++)
           {
                for (int j = array.Length - 1; j >= i; j--)  
                {
                    if (array[j] < array[j - 1])
                    {
                        exchanged = true;
                        int temp = array[j];
                        array[j] = array[j - 1];
                        array[j - 1] = temp;
                     }
                }
                if (exchanged == false)
                {
                    return;
                }
            }
        }
    }