Advertisement
BetinaUKTC

MergeSort

Dec 11th, 2020
492
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.14 KB | None | 0 0
  1. package MergeSort_184;
  2.  
  3. import java.util.Arrays;
  4. import java.util.Scanner;
  5.  
  6. import static MergeSort_184.MergeSort_Methods.*;
  7.  
  8. public class MergeSort_Methods {
  9.     void Divide(int[] arr, int l, int r) {
  10.         if (l < r) {
  11.             int m = (l + r) / 2;
  12.             Divide(arr, l, m);
  13.             Divide(arr, m + 1, r);
  14.  
  15.             MergeSort(arr, l, m, r);
  16.         }
  17.     }
  18.  
  19.     public static void MergeSort(int[] arr, int l, int m, int r) {
  20.  
  21.     }
  22. }
  23.  
  24.  
  25. public class MergeSort_Main {
  26.     public static void main(String[] args) {
  27.         Scanner scan = new Scanner(System.in);
  28.         System.out.println("Input number of elements: ");
  29.         int n = Integer.parseInt(scan.nextLine());
  30.  
  31.         int[] arr = new int[n];
  32.  
  33.         for (int i = 0; i < n; i++) {
  34.             System.out.println("Input elements: ");
  35.             int el = scan.nextInt();
  36.             arr[i] = el;
  37.         }
  38.         System.out.println("Before Sort: " + Arrays.toString(arr));
  39.  
  40.         MergeSort_Methods m = new MergeSort_Methods();
  41.         m.Divide(arr, 0, arr.length - 1);
  42.  
  43.         System.out.println("After Sort: " + Arrays.toString(arr));
  44.     }
  45. }
  46.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement