快速排序

public static int partition(int[] arr, int lo, int hi){

int key = arr[lo];

int i = lo;

int j = hi;

while(i < j){

while(arr[i] < key){

if(i == hi){

break;

}

i++;

}

while(arr[j] > key){

if(j == lo){

break;

}

j--;

}

if(i >= j){

break;

}

int t = arr[i];

arr[i] = arr[j];

arr[j] = t;

i++;

j--;

}

arr[lo] = arr[j];

arr[j] = key;

return j;

}

public static void sort3(int[] arr, int lo, int hi){

if(lo >= hi){

return ;

}

int key = arr[lo];

int i = lo+1;

int lt = lo;

int gt = hi;

while(i < gt){

if(arr[i] < key){

int t = arr[i];

arr[i] = arr[lt];

arr[lt] = t;

i++;

lt++;

}else if(arr[i] > key){

int t = arr[i];

arr[i] = arr[gt];

arr[gt] = t;

gt--;

}else{

i++;

}

}

sort3(arr,lo,lt-1);

sort3(arr,gt+1,hi);

}

public static void sort(int[] arr, int lo, int hi){

if(lo >= hi){

return ;

}

int index = partition(arr, lo, hi);

sort(arr,lo,index-1);

sort(arr,index+1, hi);

}