java 快速排序（备忘）

public class QuickSort {static String aaa = "-";public static void main(String[] args) {int[] ar = {66,3,25,4,11,12,13,14,3,78,30};//int[] ar = { 20, 23, 9 };sort(ar,0,ar.length-1);for (int i = 0; i < ar.length; i++) {System.out.print(ar[i] + ", ");}}public static void sort(int[] num,int s, int e) {//aaa = "-" + aaa;//System.out.println(s + aaa + e);int pos = Partition(num,s,e);//System.out.println("/n" + pos + ": " + num[pos]);if (s == e )return;if (pos == s){sort(num,s+1,e);}else if(pos == e){sort(num,0,e -1);}else{sort(num,0,pos-1);sort(num,pos+1,e);}}private static int Partition(int[] R,int i,int j){int pos = i,tmp;while(i<j){//System.out.println(i +"-" +j);while(R[j] > R[pos]){j--;}if(j != pos){tmp = R[j];R[j] = R[pos];R[pos] = tmp;pos = j; j--;i++;}while(R[i] < R[pos]){i++;}if(i != pos){tmp = R[i];R[i] = R[pos];R[pos] = tmp;pos = i; }}return pos;}}