java数据结构及算法.doc

文档介绍：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;j<nElems;j++)
(a[j]+" ");
("");
}
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);
}
private void swap(int one,int two){
long temp=a[one];
a[one]=a[two];
a[two]=temp;
}
}
public class BubbleSortApp{
public static void main(String[] args){
int maxSize=100;
ArrayBub arr;
arr=new ArrayBub(maxSize);
(77);
……
();
();
();
}
}
package paixu;
//选择排序
class ArraySel{
private long[] a;
private int nElems;
public ArraySel(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++)
(a[j]+" ");
("");
}
public void selectionSort(){
int out,in,min;
for(out=0;out<nElems-1;out++)
{
min=out;
for(in=out+1;in<nElems;in++)
if(a[in]<a[min])
min=in;
swap(out,min);
}
}
private void swap(int one,int two){
long temp=a[one];
a[one]=a[two];
a[two]=temp;
}
}
public c