首先我们贴出来快速排序的代码
public class QuickSort {
public int QuickSort(int[] a, int left, int right) {
int temp = a[left];
while(left < right)
{
while(left < right && a[right] >= temp)
{
right--;
}
if(left < right && a[right] < temp)
{
a[left] = a[right];
}
while(left < right && a[left] <= temp)
{
left++;
}
if(left < right && a[left] > temp)
{
a[right] = a[left];
}
}
a[left] = temp;
return left;
}
public void partion(int a[], int left, int right) {
int num;
if(left < right)
{
num = QuickSort(a, left, right);
partion(a, left, num-1);
partion(a, num + 1, right);
}
}
public static void main(String[] args) {
int a[] = {7, 2, 3, 8, 9, 6, 5, 1, 4};
QuickSort test = new QuickSort();
test.partion(a, 0, 8);
for(int i = 0; i <