快速排序法

package lanqiao_2017;

import java.util.Scanner;

public class onetest {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int []array=new int[N];
		for(int i=0;i<array.length;i++) {
			array[i]=sc.nextInt();
		}
		quickSort(array,0,array.length-1);
		for(int i=0;i<array.length;i++) {
			System.out.println(array[i]);
		}
	}
	
	
	static void quickSort(int array[],int left,int right){
		int i,j,temp;
		if(left>right) {
			return;
		}
		i=left;
		j=right;
		temp=array[left];
		while(i<j&&temp<=array[j]) {
			j--;
		}
		while(i<j&&temp>=array[i]) {
			i++;
		}
		if(i<j) {
			int t=array[i];
			array[i]=array[j];
			array[j]=t;
		}
		array[left]=array[i];
		array[i]=temp;
		quickSort(array, left, i-1);
		quickSort(array, j+1, right);
	}
}