Java[快速排列]

import java.util.Scanner;
import java.io.BufferedInputStream;  
public class Main{
    public static void quickSort(int arr[],int low,int high){
        if(low>=high){   
            return;
        }
        int temp=arr[(low+high)/2]; //这里可以每次取第一个数，但是会超时
        int i=low;
        int j=high;
        while(i<j){

            while(arr[j]>temp){  //这里取等应该会出问题
                j--;
            }
            while(arr[i]<temp){
                i++;
            }
            if(i<=j){
                int pm=arr[i];
                arr[i]=arr[j];
                arr[j]=pm;
                i++;           //别忘了这里
                j--;
            }

        }
        quickSort(arr,low,j);
        quickSort(arr,i,high);



    }

    public static void main(String[] args){
         //据说用BufferedInputStream能提高效率
        Scanner in = new Scanner(new BufferedInputStream(System.in));
        int n = in.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }
        quickSort(arr,0,n-1);
        for (int i = 0; i < n; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();

    }
}