Merge Sort Java Program with Source Code

Merge Sort Java Program ; Merge sort (also known as mergesort) is a general-purpose, comparison-based sorting algorithm developed in computer science. The majority of implementations create a stable Merge sort examples, which means that the order of equal elements in the input and output is the same.

Array and buffered reader are used in the project to accomplish merge sort. The “Divide-and-Conquer” method is used in the merge sort algorithm.

We have included downloadable zip file at the end of the program so that you may run the following codes.

Merge Sort Java Program : Sample Code

//Merge Sort Java Program : Sample Code    

package mergesortjavaprogram;

import java.util.Scanner;


public class MergeSortJavaProgram {

    public static void merge(int a[], int l, int m, int h) {
        int i, j, c = l;
        int b[] = new int[h + 1];

        for (i = l, j = m + 1; i <= m && j <= h; c++) {

            if (a[i] <= a[j]) {
                b[c] = a[i++];
            } else {
                b[c] = a[j++];
            }
        }
        while (i <= m) {
            b[c++] = a[i++];
        }

        while (j <= h) {
            b[c++] = a[j++];
        }

        for (i = l; i <= h; i++) {
            a[i] = b[i];
        }
    }

    public static void Sort(int a[], int l, int h) {
        if (l < h) {
            int m = (l + h) / 2;
            Sort(a, l, m);
            Sort(a, m + 1, h);
            merge(a, l, m, h);

        }

    }

    public static void printarray(int a[]) {
        for (int i = 0; i < a.length; i++) {

            System.out.print(a[i] + "  ");
        }

    }

    public static void main(String[] args) {
        int n, res, i;
        Scanner s = new Scanner(System.in);
        System.out.print("Enter number of elements in the array:");
        n = s.nextInt();
        int a[] = new int[n];
        System.out.println("Enter " + n + " elements ");
        for (i = 0; i < n; i++) {
            a[i] = s.nextInt();
        }

        System.out.println("elements in array ");
        printarray(a);
        Sort(a, 0, n - 1);
        System.out.println("\nelements after sorting");
        printarray(a);

    }

}

Merge Sort Java Program : Sample Code Output

//Merge Sort Java Program: Sample Code Output

Enter number of elements in the array:5
Enter 5 elements 
4
5
3
2
0
elements in array 
4  5  3  2  0  
elements after sorting
0  2  3  4  5

What is the importance of Program of merge sort in java?

What is the importance of Program of merge sort?

The merge step solves the problem of combining two sorted lists (arrays) into a single large sorted list (array). The technique keeps track of three pointers: one for each of the two arrays and one for the final sorted array’s current index.

Java is an object-oriented, cross-platform programming language with excellent memory management and security capabilities. It also supports multithreading, allowing you to write code that performs multiple tasks at once.

As a result, beginners should concentrate on mastering this simple problem project.

What is the use of Merge sort examples?

What is the use of Merge sort examples

Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then it merges the two sorted halves. The merge() function is used for merging two halves.