冒泡排序算法代码

 private void bubleSort(int[] data) {
        int size = data.length;
        while (size >= 2) {
            boolean exchanged = false;

            for (int i = 0; i < size - 1; i++) {
                if (data[i] > data[i + 1]) {
                    int tmp = data[i];
                    data[i] = data[i + 1];
                    data[i + 1] = tmp;
                    exchanged = true;
                }
            }//for.

            if (!exchanged) {
                break;
            }

            size--;
        }

        Log.e("bubles", "finished,size=" + size);
        for (int i : data)
            Log.e("bubles", i + "");
    }