今天在捋一捋快排
快排思想:选中一个基数(下面代码选了最左的为基数),把小于基数的数字放在左边,把大于基数的数字放在右边,然后不断递归
import java.util.Arrays;
/**
* 快排
* @author Administrator
*
*/
public class MyQuickSort {
public static void main(String[] args) {
int[] arr = {1,2};
new MyQuickSort().doSort(arr, 0, arr.length-1);
System.out.println(Arrays.toString(arr));
}
public void swap(int[] arr,int low,int hight) {
int temp = arr[low];
arr[low] = arr[hight];
arr[hight] = temp;
}
public void doSort(int[] arr, int begin,int end) {
int base = arr[begin];
int left = begin;
int right = end;
while(left < right) {
while(right > left && arr[right] >= base) {
right--;
}
swap(arr,left,right);
while(left < right && arr[left] <= base) {
left++;
}
swap(arr,left,right);
}
if(begin < left-1) doSort(arr,begin,left-1);//排左边
if(left+1 < end) doSort(arr,left+1,end);//排右边
}
}