Java数据结构及算法.docVIP

package paixu; //冒泡排序 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;jnElems;j++) System.out.println(a[j]+ ); System.out.println(); } public void bubbleSort(){ int out,in; for(out=nElems-1;out1;out--) for(in=0;inout;in++) if(a[in]a[in+1]) swap(in,in+1); } private void swap(int one,int two){ long temp=a[one]; a[one]=a[two]; a[two]=temp; } } public class BubbleSortApp{ public static void m