Java 快速排序

package com.day7.homework.homework2;

import java.util.Arrays;

public class QuickSort {
   

	public static void main(String[] args) {
   
		int[] arr = new int[]{
   72,72,89,65,58,68,87,91,53,89,82,71,93,76,68};
		quick(arr, 0, arr.length-1);
		System.out.println(Arrays.toString(arr));
	}
	

	private static void quick(int[] arr, int low, int high) {
   
		if(low >= high) {
   
			return;
		}
		int tempdata = arr[low];
		int i = low, j = high;
		while(i < j) {
   
			while(arr[j] >= tempdata && j > i) {
   
				j--;
			}
			arr[i] = arr[j];
			while(arr[i] <= tempdata && i < j) {
   
				i++;
			}
			arr[j] = arr[i];
		}
		arr[i] = tempdata;
		quick(arr, low, i-1);
		quick(arr, i+1, high);
	}
}