The Merge Sort is one of the most efficient sorting algorithms. It is based on the divide-and-conquer method. In this article, I am going to explain how the algorithm works and why it is so efficient.
The merge sort algorithm belongs to the family of efficient sorting algorithms whose average complexity is O(n log(n)). This is the best performance that can be achieved with a comparison-based algorithm.
It is also an example of a divide-and-conquer method. This method solves a problem recursively, applying the three steps of recursion:
Make it inspire 🌐