[数据结构][Sort]Bubble Sort

public class Solution
{
    public void bubbleSort(int[] data)
    {
        for(int i = 0; i < data.length; i ++)
        {
            int exchangeCount = 0;

            for(int j = 0; j < data.length - i -1; j ++)
            {
                if(data[j] > data[j + 1])
                {
                    exchange(data, j, j + 1);
                    
                    exchangeCount ++;
                }
            }
            
            if(exchangeCount == 0)
            {
                return;
            }
        }
    }
    public void exchange(int[] data, int m, int n)
    {
        int memory = data[m];
        data[m] = data[n];
        data[n] = memory;
    }
}