快速排序

简单的数组快速排序

代码实现

import java.util.Arrays;

public class QuickSortDemo{
	public static void main(String[] args) {
		int[] arr = {6,7,8,1,5,4};
		quickSort(arr,0,arr.length - 1);
		System.out.println(Arrays.toString(arr));
	}

 	public static void quickSort(int[] arr,int left,int right) {
 		if (left > right) {
			return;
		}
 		int base = arr[left];
 		int i = left;
 		int j = right;
 		while(i != j) {
 			while(arr[j] >= base && i < j) {
 				j--;
 			}
 			while(arr[i] <= base && i < j) {
 				i++;
 			}
 			int temp = arr[i];
 			arr[i] = arr[j];
 			arr[j] = temp;
 		}
 		arr[left] = arr[i];
 		arr[i] = base;
 		quickSort(arr,left,i-1);
 		quickSort(arr,j+1,right);
 	}
 }