Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package MergeSort_184;
- import java.util.Arrays;
- import java.util.Scanner;
- import static MergeSort_184.MergeSort_Methods.*;
- public class MergeSort_Methods {
- void Divide(int[] arr, int l, int r) {
- if (l < r) {
- int m = (l + r) / 2;
- Divide(arr, l, m);
- Divide(arr, m + 1, r);
- MergeSort(arr, l, m, r);
- }
- }
- public static void MergeSort(int[] arr, int l, int m, int r) {
- }
- }
- public class MergeSort_Main {
- public static void main(String[] args) {
- Scanner scan = new Scanner(System.in);
- System.out.println("Input number of elements: ");
- int n = Integer.parseInt(scan.nextLine());
- int[] arr = new int[n];
- for (int i = 0; i < n; i++) {
- System.out.println("Input elements: ");
- int el = scan.nextInt();
- arr[i] = el;
- }
- System.out.println("Before Sort: " + Arrays.toString(arr));
- MergeSort_Methods m = new MergeSort_Methods();
- m.Divide(arr, 0, arr.length - 1);
- System.out.println("After Sort: " + Arrays.toString(arr));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement