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