冒泡排序（面向对象）

package TestBubblesort;

/**
 * Created by Administrator on 2017/5/4.
 */
public class ArrayBub {
    private long[]a;
    private int nElems;
    public ArrayBub(int max){
        a = new long[max];
        nElems = 0;
    }
    public void insert(long value){
        a[nElems] = value;
        nElems++;
    }
    public void display(){
        for (int j = 0; j <nElems ; j++) {
            System.out.print(a[j]+" ");
        }
    }

    public void selectionSort() {
        int in , out;
        for (out = 1; out <nElems ; out++) {
            long temp = a[out];
            in = out;
            while (in>0 && a[in-1]>=temp){
                a[in]=a[in-1];
                --in;
            }
            a[in] = temp;
        }
    }
}

package TestBubblesort;

/**
 * Created by Administrator on 2017/5/4.
 */
public class BubbleSortApp {
    public static void main(String[] args) {
        ArrayBub arrayBub= new ArrayBub(15);
        arrayBub.insert(10);
        arrayBub.insert(50);
        arrayBub.insert(30);
        arrayBub.insert(12);
        arrayBub.insert(46);
        arrayBub.insert(78);
        arrayBub.insert(25);
        arrayBub.insert(99);
        System.out.print("原数组为：");
        arrayBub.display();
        System.out.println();
        System.out.print("排序后的数组为：");
        arrayBub.selectionSort();
        arrayBub.display();
    }
}