Java之冒泡排序

public class ArrayBub{long array[];int index;public ArrayBub(int max) {super();// TODO Auto-generated constructor stubarray = new long[max];index = -1;}//插入public boolean insert(long item){if (index < (array.length-1)){array[++index] = item;return true;}else {return false;}}//打印public void display(){int len = array.length;for (int i = 0; i < len; i++){System.out.println("array[" + i +"] = " + array[i]);}}//冒泡排序public void sort(){if (array.length > 0){for (int i = index-1; i >= 0; i--){for (int j = 0; j <= i; j++){if (array[j] > array[j+1]){swap(j, j+1);}}}}}//交换public void swap(int one, int two){long temp = array[one];array[one] = array[two];array[two] = temp;}}