八大排序算法——冒泡排序（五）

//冒泡排序
public class BubbleSort {
    public void bubbleSort(int[] data, int left, int right) {
        if (left < 0 || right > data.length - 1 || left >= right) {
            return;
        }
        int count = 0;//记录已完成的轮数，n个数排序，需要n-1轮
        while (count < right - left) {
            for (int i = left; i < right - count; i++) {
                if (data[i] > data[i + 1])
                    swap(data, i, i + 1);
            }
            count++;
        }
    }

    private void swap(int[] data, int left, int right) {
        int temp = data[left];
        data[left] = data[right];
        data[right] = temp;
    }
}