洛谷P5715

本人用java的快速排序写的供参考

import java.util.Scanner;

public class Main {
	public static void a(int[] arr,int low,int height){
		int i=low;
		int j=height;
		if(low>height){
			return;
		}
		int temp=arr[low];
		while(i!=j){
			while(arr[j]>=temp&&i<j){
				j--;
			}while(arr[i]<=temp&&i<j){
				i++;
			}if(i<j){
				int temp2=arr[i];
				arr[i]=arr[j];
				arr[j]=temp2;
			}
		}arr[low]=arr[j];
		arr[j]=temp;
		a(arr, low, j-1);
		a(arr, j+1, height);
		
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		int[] arr=new int[3];
		for (int i = 0; i < arr.length; i++) {
			arr[i]=sc.nextInt();
		}
		a(arr, 0, arr.length-1);
		for (int i = 0; i < arr.length; i++) {
			System.out.print(arr[i]+" ");
		}
		
		
	
	}

}