fork download
  1. import java.util.Scanner;
  2.  
  3. public class Main {
  4. public static void merge(int[] arr, int left, int mid, int right) {
  5. int n1 = mid - left + 1;
  6. int n2 = right - mid;
  7.  
  8. int[] L = new int[n1];
  9. int[] R = new int[n2];
  10.  
  11. for (int i = 0; i < n1; i++) {
  12. L[i] = arr[left + i];
  13. }
  14. for (int j = 0; j < n2; j++) {
  15. R[j] = arr[mid + 1 + j];
  16. }
  17.  
  18. int i = 0;
  19. int j = 0;
  20. int k = left;
  21.  
  22. while (i < n1 && j < n2) {
  23. if (L[i] <= R[j]) {
  24. arr[k] = L[i];
  25. i++;
  26. } else {
  27. arr[k] = R[j];
  28. j++;
  29. }
  30. k++;
  31. }
  32.  
  33. while (i < n1) {
  34. arr[k] = L[i];
  35. i++;
  36. k++;
  37. }
  38.  
  39. while (j < n2) {
  40. arr[k] = R[j];
  41. j++;
  42. k++;
  43. }
  44. }
  45.  
  46. public static void mergeSort(int[] arr, int left, int right) {
  47. if (left < right) {
  48. int mid = left + (right - left) / 2;
  49.  
  50. mergeSort(arr, left, mid);
  51. mergeSort(arr, mid + 1, right);
  52.  
  53. merge(arr, left, mid, right);
  54. }
  55. }
  56.  
  57. public static void main(String[] args) {
  58. Scanner scanner = new Scanner(System.in);
  59.  
  60. int n = scanner.nextInt();
  61. int[] arr = new int[n];
  62.  
  63. for (int i = 0; i < n; i++) {
  64. arr[i] = scanner.nextInt();
  65. }
  66.  
  67. mergeSort(arr, 0, n - 1);
  68.  
  69. for (int i = 0; i < n; i++) {
  70. System.out.print(arr[i] + " ");
  71. }
  72. System.out.println();
  73. scanner.close();
  74. }
  75. }
Success #stdin #stdout 0.14s 58948KB
stdin
7
10 5 8 4 3 11 1
stdout
1 3 4 5 8 10 11