Java merge sort is a type of sorting method in which the array is divided into two halves, and these halves are sorted. After sorting, these halves are merged. This process recursively takes place as every half of the array is again divided into two halves, sorted and merged.

Merge Sort in Java

Like  QuickSort, MergeSort is the Divide and Conquer algorithm. It divides input  array into two halves, calls itself for the two halves and then merges that two sorted halves. The merge() function is used for merging the two halves. In one sentence, we can say, in Merge Sort, we perform Divide Operation, then Conquer and Combine Operation.

Merge sort is the “divide and conquer” algorithm in which we first divide the problem into many subproblems.

When we have solutions for the subproblems, we combine them together to get a final solution.

It is a very easy algorithm, which can be easily implemented using the recursion as we deal with the subproblems rather than the big main problem.

#java #java merge sort #quicksort