快速排序一

public class ArrayIns {
private long[] theArray;
private int nElems;

public ArrayIns(int max){
theArray=new long[max];
nElems=0;
}

public void insert(long value){
theArray[nElems]=value;
nElems++;
}

public int size(){
return nElems;
}

public void display(){
System.out.print("A=");
for(int j=0;j<nElems;j++)
System.out.print(theArray[j]+" ");
System.out.println("");
}

public int partitionIt(int left,int right,long pivot){
int leftPtr=left-1;
int rightPtr=right;
while(true){
while(theArray[++leftPtr]<pivot){
}
while(rightPtr>0&&theArray[--rightPtr]>pivot){
}
if(leftPtr>=rightPtr){
break;
}else{
swap(leftPtr,rightPtr);
}
}
swap(leftPtr,right);
return leftPtr;
}

public void swap(int dex1,int dex2){
long temp=theArray[dex1];
theArray[dex1]=theArray[dex2];
theArray[dex2]=temp;
}

public void quickSort(){
recQuickSort(0,nElems-1);
}

public void recQuickSort(int left,int right){
if(right-left<=0){
return;
}else{
long pivot = theArray[right];
int partition = partitionIt(left,right,pivot);
recQuickSort(left,partition-1);
recQuickSort(partition+1,right);
}
}
}

public class QuickSortApp {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int maxSize=16;
ArrayIns arr;
arr = new ArrayIns(maxSize);
for(int j=0;j<maxSize;j++){
long n=(int)(Math.random()*99);
arr.insert(n);
}
arr.display();
arr.quickSort();
arr.display();
}
}