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. 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. int i = 0, j = 0;
  18. int k = left;
  19.  
  20. while (i < n1 && j < n2) {
  21. if (L[i] <= R[j]) {
  22. arr[k++] = L[i++];
  23. } else {
  24. arr[k++] = R[j++];
  25. } }
  26. while (i < n1) {
  27. arr[k++] = L[i++];
  28. }
  29.  
  30. while (j < n2) {
  31. arr[k++] = R[j++];
  32. } }
  33.  
  34. public static void mergeSort(int[] arr, int left, int right) {
  35. if (left < right) {
  36. int mid = left + (right - left) / 2;
  37. mergeSort(arr, left, mid);
  38. mergeSort(arr, mid + 1, right);
  39. merge(arr, left, mid, right);
  40. } }
  41.  
  42. public static void main(String[] args) {
  43. Scanner scanner = new Scanner(System.in);
  44. int n = 8;
  45. int[] arr = new int[n];
  46.  
  47. for (int i = 0; i < n; i++) {
  48. arr[i] = scanner.nextInt();
  49. }
  50. scanner.close();
  51. mergeSort(arr, 0, n - 1);
  52.  
  53. for (int i = 0; i < n; i++) {
  54. System.out.print(arr[i] + " ");
  55. }
  56. System.out.println();
  57. }
  58. }
Success #stdin #stdout 0.17s 56972KB
stdin
1 10 11 2 8 7 4 5
stdout
1 2 4 5 7 8 10 11