import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
while(cin.hasNext()){
int n = cin.nextInt();
int[]a = new int[n];
int i;
for(i = 0; i < n; i++)
a[i] = cin.nextInt();
qsort(a, 0,n - 1);
for(i = 0; i < n; i++)
System.out.println(a[i]);
}
}
private static void qsort(int[] a, int l, int r){
if(l >= r)return ;
int i = l;
int j = r;
int k = l;
int t;
while(l < r){
while(a[r] >= a[k] && l < r)r–;
while(a[l] <= a[k] && l < r)l++;
t = a[l];
a[l] = a[r];
a[r] = t;
}
t = a[l];a[l] = a[k]; a[k] = t;
qsort(a, i, l - 1);
qsort(a, l + 1, j);
}
}
快速排序算法(java)
最新推荐文章于 2023-06-04 10:54:50 发布