Blog Image

Merge Sort Algorithm  

In this blog we are discussing about merge sort alogrithm. How to implement merge sorting algorithm is discussed below with sample example as part of attachment. The steps to implement the algorithm is given as part of this blog.

Merge Sort Algorithm:
Merge sort is a divide-and-conquer algorithm. In this we have to break the list/array in several parts or sub-lists until each sub list consists of a single element and merging those elements in so that we will get the final sorted list/array. Merge sort is the recursive sorting algorithm.

Steps for using Merge sort algorithm:

  • 1)Divide the list/array into two parts i.e. divide the array/list into right half and left half.
  • 2)Divide the left half and right half of list/array into sub-lists until it becomes only one element in the list/array.
  • 3)Merge the elements into list of two element such a way that lesser value element will come first.
  • 4)Merge all the elements until it become single sorted list.
Divide and Conquer Algorithm:
Consider we have a list of elements, so divide and conquer algorithm means dividing the list into sub-lists or sub-parts until no more sub-parts can be created. As shown in below diagram the list is divided in such a way that no more sub parts of the list will be created. This is called atomic nature of the list.  After getting these atomice parts, the again the parts has to be sorted and converted into list from  the sub-parts or sub-lists.
Following diagram shows how the merge sublist will be sorted:

Following is the basic example on merge sort:

public class MergeSortAlgorithm {
    public static void main(String[] args) {
        int[] inputArray = { 41, 30, 46, 6, 12, 85, 13 };
        int[] mergeSortedArray = doMergeSort(inputArray);
        for (int i = 0; i < mergeSortedArray.length; i++)
            System.out.print(mergeSortedArray[i] + " ");

    public static int[] doMergeSort(int[] inputArray) {
        int n = inputArray.length;
        int a = 0;
        int b = 0;
        int c = 0;

        if (n == 1) {
            /* as only one element means already sorted */
            return inputArray;

        int mid = n / 2;
        /* creating array for left side of middle index */
        int[] leftArray = new int[mid];
        /* creating array for right side of middle index */
        int[] rightArray = new int[n - mid];

        /* getting array on left side of middle index */
        System.arraycopy(inputArray, 0, leftArray, 0, leftArray.length);

        /* getting array on right side of middle index */
        System.arraycopy(inputArray, leftArray.length, rightArray, 0, rightArray.length);


        while (a < leftArray.length && b < rightArray.length) {
            if (leftArray[a] < rightArray[b]) {
                inputArray[c] = leftArray[a];
            } else {
                inputArray[c] = rightArray[b];
        /* copy the rest of the first half if there is anything left */
        while (a < leftArray.length) {
            inputArray[c] = leftArray[a];
        /* copy the rest of the second half if there is anything left */
        while (b < rightArray.length) {
            inputArray[c] = rightArray[b];
        return inputArray;

The output for the merge sort example is :

6 12 13 30 41 46 85

You can download the above example from the below attachments.

About author

User Image

I am a software developer. I am working working on jdk , jee technologies. I am working on Spring Framework as well. I am passionate about learning java technologies like Web Services and Restful Services.



Be the first person to write a comment for this Blog
Load More

No More Comments

Leave a Comment

Your comment has been posted and will appear soon.