Main.java

importjava.util.Scanner;

publicclassMain {
publicstaticvoidmain(String[] args) {
Scannersc = newScanner(System.in);
intn = sc.nextInt();
int[] nums = newint[n];
for (inti = 0; i < n; ++i) {
nums[i] = sc.nextInt();
 }
quickSort(nums, 0, n - 1);
for (inti = 0; i < n; ++i) {
System.out.print(nums[i] + " ");
 }
 }

publicstaticvoidquickSort(int[] nums, intleft, intright) {
if (left >= right) {
return;
 }
inti = left - 1, j = right + 1;
intx = nums[(left + right) >> 1];
while (i < j) {
while (nums[++i] < x)
 ;
while (nums[--j] > x)
 ;
if (i < j) {
intt = nums[i];
nums[i] = nums[j];
nums[j] = t;
 }
 }
quickSort(nums, left, j);
quickSort(nums, j + 1, right);
 }
}