Java实现快速排序

速度上代码

import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;

import javax.swing.text.ChangedCharSetException;

public class Test {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		System.out.println("输入整数n:");
		int n=new Scanner(System.in).nextInt();
		int[] arr=new int[n];
		for(int i=0;i<n;i++) {
			arr[i]=new Random().nextInt(200);
		}
		//System.out.println(Arrays.toString(arr));
		long c1=System.currentTimeMillis();
		int[] arr1=quickSort(arr,0,arr.length-1);
		long c2=System.currentTimeMillis()-c1;
		System.out.println("运行时间:"+c2);
		System.out.println(Arrays.toString(arr1));
		
	}

	private static int[] quickSort(int[] arr, int left, int right) {
		// TODO Auto-generated method stub
		int lo=left;
		int hi=right;
		int base=arr[left];
		while(left<right){
			while(arr[right]>=base&&right!=left){
				right--;
			}
			if(arr[right]<base){
				arr[left]=arr[right];
			}
			
			while(arr[left]<=base&&right!=left){
				left++;
			}
			
			if(arr[left]>base){
				arr[right]=arr[left];
			}
			
			if(left<=right)
				arr[left]=base;
		}
		if(lo<=right){
			quickSort(arr,lo,right-1);
		}
		if(left<hi){
			quickSort(arr,left+1,hi);
		}		
		if(lo==hi) {
			hi++;
		}
		return arr;
	}
}