快速排序

package DAY5_10;

import java.util.Scanner;

public class Sequence {
	static void swap(int[] a,int k,int i) {
 		if(k!=i) {
 			a[k] = a[k]^a[i];
 	 		a[i] = a[k]^a[i];
 	 		a[k] = a[k]^a[i];
 		}
		
	}
	
	static int partition(int arr[],int low,int high){
		int i = low-1;
		int pivot = arr[high];//驱轴
		for(int j = low;j < high;j++) {
			if(arr[j] <= pivot) {
				i++;
				swap(arr,i,j);
			}
		}
		swap(arr,i+1,high);
		return i+1;//返回的值为下次快排找中间的驱轴下标
	}
	
	static void quick_sort(int arr[],int low,int high) {
		if(low < high) {
			int pi = partition(arr,low,high);
			quick_sort(arr,low,pi-1);
			quick_sort(arr,pi+1,high);
		}
	}
	
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt();
		
		int[] arr = new int[a];
		
		for(int i = 0;i < a;i++) {
			arr[i] = sc.nextInt();
		}
		
		quick_sort(arr,0,a-1);
		
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+" ");
		}
	}
}