import java.util.*;
/
* packageName Basic
* @author chizhou
* @version JDK 8
* @className MergeSort (此处以class为例)
* @date 2024/4/21
* @description 归并排序
/
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] nums = new int[n];
for (int i = 0; i < n; i) {
nums[i] = scan.nextInt();
}
mergeSort(nums, 0, n - 1);
for (int i = 0; i < n; i) {
System.out.print(nums[i]);
if (i != n - 1) {
System.out.print(” “);
}
}
}
private static void mergeSort(int[] nums, int l, int r) {
if (l >= r) return;
// 设置分界点
int mid = (l + r) >> 1;
mergeSort(nums, l, mid);
mergeSort(nums, mid + 1, r);
// 左右归并,填入temp数组
int[] temp = new int[r - l + 1];
int i = l, j = mid + 1, t = 0;
while (i <= mid && j <= r) {
if (nums[i] <= nums[j]) {
temp[t++] = nums[i++];
} else {
temp[t++] = nums[j++];
}
}
while (i <= mid) temp[t++] = nums[i++];
while (j <= r) temp[t++] = nums[j++];
// 归并完毕,赋值回原数组
for (int k = 0, h = l; k < r - l + 1; k++, h++) {
nums[h] = temp[k];
}
}
}