冒泡排序 两两比较

package com.data.cn;

import com.sun.org.apache.regexp.internal.RE;

/**
 * Created by kaily on 17/5/10.
 */

public class BubbleSort {
    private int MAX_LENGTH = 100;
    private int num;
    private long[] values;

    public BubbleSort() {
        values = new long[MAX_LENGTH];
    }

    public BubbleSort(int maxLength) {
        this.MAX_LENGTH = maxLength;
        values = new long[MAX_LENGTH];
    }

    public int insert(long value) {
        if (num >= MAX_LENGTH) {
            return -1;
        }
        values[num] = value;
        num++;
        return num - 1;
    }

    public long get(int index) {
        if (index > (MAX_LENGTH - 1)) {
            return -1;
        }
        return values[index];
    }

    public void bubbleSort() {
        for (int i = num - 1; i > 0; i--) {
            for (int j = 0; j < i; j++) {
                if (values[j] > values[j + 1]) {
                    long temp = values[j + 1];
                    values[j + 1] = values[j];
                    values[j] = temp;
                }
            }
        }
    }

    public int size() {
        return num;
    }

}