快速排序

public class QuickSort {private static int[] data= {5,3,1,9,8,2,4,7};private void sortPart( int l, int r){if(l < r){int i = l + 1;int j = r -1;int x = data[l];int temp;while(i < j){while(x > data[i]){i ++;}while(x < data[j]){j --;}System.out.println("x=" + x + " i=" + i + " j=" +j);if(i < j){temp = data[j];data[j] = data[i];data[i] = temp;}}temp = data[j];data[j] = data[l];data[l] = temp;sortPart(l, j - 1);sortPart(j + 1, r);}}public static void main(String[] args) {(new QuickSort()).sortPart(0, data.length);for(int i = 0; i < data.length; i ++){System.out.print(data[i]+" ");}}}