AcWing 785. 快速排序(Java)
原题链接
简单
作者:
火球大的脸盆
,
2022-07-06 18:41:37
,
所有人可见
,
阅读 125
import java.io.*;
public class Main {
public static void quick_sort(int q[], int l, int r) {
if (l >= r) return;
int x = q[l + r >> 1], i = l - 1, j = r + 1;
while (i < j) {
do i++; while (q[i] < x);
do j--; while (q[j] > x);
if (i < j) {
int tmp = q[i];
q[i] = q[j];
q[j] = tmp;
}
}
quick_sort(q, l, j);
quick_sort(q, j + 1, r);
}
public static void main(String[] args) throws IOException {
int n;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
n = Integer.parseInt(br.readLine());
String[] str = br.readLine().split(" ");
int[] q = new int[n];
for (int i = 0; i < n; i++) q[i] = Integer.parseInt(str[i]);
quick_sort(q, 0, n - 1);
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
for (int i = 0; i < n; i++) {
bw.write(q[i] + " ");
bw.flush();
}
}
}