C++ Merge sort is an efficient and comparison-based algorithm to sort an array or a list of integers you can say. It is a Divide and Conquer algorithm which was invented by John von Neumann in 1945. Now you may question what is Divide and Conquer method.

Merge sort first divides an array into equal halves and then combines them in a sorted manner.

You can check out  Bubble Sort and  Selection Sort examples in this blog.

C++ Merge Sort Example

Let’s discuss the divide and concur method. It has the following three tasks.

1. Divide the problems into subproblems that are similar to the original but smaller in size.
2. Conquer the sub-problems in recursively. If they are smaller in size solve them in a straight forward manner.
3. Combine those solutions to a solution which is the answer to the original problem.

Merge sort keeps on dividing the list into equal halves until it can no more be divided. By definition, if it is only one element in the list, it is sorted. Then, merge sort combines the smaller sorted lists keeping the new list sorted too.

#c++ #c++ merge sort