java选择排序

public 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 i = 0;i<nElems;i++){
System.out.print(a[i]+" ");
}
System.out.println("");
}
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 class SelectSortApp {
public static void main(String[] args) {
int maxSize = 100;
ArraySel arr = new ArraySel(maxSize);
arr.insert(23);
arr.insert(56);
arr.insert(657);
arr.insert(134);
arr.insert(45);
arr.insert(536);
arr.insert(825);
arr.insert(24);
arr.insert(687);
arr.insert(139);
arr.display();
arr.selectionSort();
arr.display();
}
}

23 56 657 134 45 536 825 24 687 139
23 24 45 56 134 139 536 657 687 825