快速排序算法

package sort;

import java.util.Arrays;

/**
 * 快速排序
 *
 */
public class Quick7 {
	
	public static void main(String[] args) {
		int[] arr1 = {44,38,5,47,15,31,32,88,2,23,43,54,1,7,56,100,101,102};
		quickSort(arr1);
		System.out.println(Arrays.toString(arr1));
	}
	
	public static void quickSort(int[] arr1) {
		sort(arr1,0,arr1.length-1);
	}
	
	public static void sort(int[] arr,int left,int right){
		if(left>right) {
			return;
		}
		int target=arr[left];
		int i=left;
		int j=right;
		
		while(i!=j) {
			while(arr[j]>=target&&i<j) {
				j--;
			}
			while(arr[i]<=target&&i<j) {
				i++;
			}
			if(i<j) {
				int temp=arr[i];
				arr[i]=arr[j];
				arr[j]=temp;
			}
		}
		arr[left]=arr[i];
		arr[i]=target;
		sort(arr,left,i-1);
		sort(arr,i+1,right);
	}
	
}