快速排序

import java.util.Scanner;public class Main {public static void quicksort(int arr[], int start, int end) {if (start < end) {int min = start;int max = end;int temp = arr[start];while (min < max) {while (min < max && arr[max] > temp) {max--;}if (min < max) {arr[min++] = arr[max];}while (min < max && arr[min] < temp) {min++;}if (min < max) {arr[max--] = arr[min];}}arr[min] = temp;quicksort(arr, start, min - 1);quicksort(arr, min + 1, end);}}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);while (scanner.hasNext()) {int number = scanner.nextInt();int arr[] = new int[number];for (int i = 0; i < arr.length; i++) {arr[i] = scanner.nextInt();}quicksort(arr, 0, number - 1);for (int i = 0; i < arr.length; i++) {System.out.print(arr[i] + " ");}System.out.println();}}}