java实现快速排序

publicclassTestArray...{

publicstaticvoidmain(String[]args)...{
int[]array=...{49,38,65,97,76,13,27,49};
for(inti=0;i<array.length;i++)...{
System.out.print(""+array[i]);
}
System.out.println();
System.out.println();
TestArrayta=newTestArray();
ta.quickSort(array,0,7);
for(inti=0;i<array.length;i++)...{
System.out.print(""+array[i]);
}
System.out.println();
}

publicvoidquickSort(int[]obj,intx,inty)...{
inti=x;
intj=y;
intmid=obj[(x+y)/2];
while(i<=j)...{
while(obj[i]<mid)...{
i++;
}
while(obj[j]>mid)...{
j--;
}
inttemp;
if(i<=j)...{
temp=obj[i];
obj[i]=obj[j];
obj[j]=temp;
i++;
j--;
}
}
for(intk=0;k<obj.length;k++)...{
System.out.print(""+obj[k]);
}
System.out.println();
System.out.println();
if(x<j)...{
quickSort(obj,x,j);
}
if(i<y)...{

quickSort(obj,i,y);
}
}
}