Java Program for Merge Sort

Merge Sort is a divide-and-conquer algorithm. It divides the input array into two halves, calls itself the two halves, and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, l, m, r) is a key process that assumes that arr[l..m] and arr[m+1..r] are sorted and merges the two sorted sub-arrays into one. 

Please refer complete article on for more details.

Merge Sort Algorithm

There are only five steps to understand Merge Sort Algorithm:

• Step 1: Divide Array into Two Parts.
• Step 2: Merge Sort the first part of the array.
• Step 3: Merge Sort the second part of the array.
• Step 4: Merge Both the parts.
• Step 5: Return the Sorted Array

Base Conditions for Merge Sort is: Divide the Array till the size of Array is greater than 1.

Program of Merge Sort in Java

5 6 7 11 12 13 

The complexity of the above method:

Time Complexity: O(n log n)
Auxiliary Space: O(n)

Advantages of Merge Sort

The advantages of Merge Sort are mentioned below:

• Stability: Merge sort is a stable sorting algorithm, which means it maintains the relative order of equal elements in the input array.
• Guaranteed worst-case performance: Merge sort has a worst-case time complexity of O(n log n), which means it performs well even on large datasets.
• Parallelizable: Merge sort is a naturally parallelizable algorithm, which means it can be easily parallelized to take advantage of multiple processors or threads.

References: Please refer complete article on Merge Sort for more details.