冒泡排序 Java数据结构与算法

 

class ArrayBub {

    private long[] a; // ref to array a
    private int nElems; // number of date items
    public ArrayBub(int max) { // constructor
        a = new long[max]; // create the array
        nElems = 0; // no items yet
    }
    
    /**
     * 插入
     * @param value
     */
    public void insert(long value) // put element into array
    {
        a[nElems] = value; // insert it
        nElems++; // increment size
    }

    /*
     * 显示数据
     */
    public void display() // displays array contents
    {
        for (int j = 0; j < nElems; j++)
            // for each element,
            System.out.print(a[j] + " "); // display it
        System.out.println("");
    }

    /**
     * 冒泡排序
     */
    public void bubbleSort() {
        int out, in;
        for (out = nElems - 1; out > 1; out--)
            for (in = 0; in < out; in++)
                if (a[in] > a[in + 1])
                    swap(in, in + 1);
    }// end bubbleSort()
        // --------------------------------------------

    private void swap(int one, int two) {
        long temp = a[one];
        a[one] = a[two];
        a[two] = temp;
    }
    // ---------------------------------------------
}// end class ArrayBub
// /////////////////////////////////////////////////

public class bubbleSort {
    public static void main(String args[]) {
        int maxSize = 100; // array size
        ArrayBub arr; // reference to array
        arr = new ArrayBub(maxSize); // create the array
        arr.insert(77); // insert 10 items
        arr.insert(99);
        arr.insert(44);
        arr.insert(55);
        arr.insert(22);
        arr.insert(88);
        arr.insert(11);
        arr.insert(00);
        arr.insert(66);
        arr.insert(33);
        arr.display(); // display items
        arr.bubbleSort(); // bubble sort them
        arr.display();
    }// end main()
}// end class BubbleSortApp