In this blog entry, I will be attempting to explain merge sort to the best of my abilities. I will try to cover everything from the basics of what merge sort is to its functioning and I will also lay out its pros and cons as a sorting algorithm.
Merge sort is a recursive sorting algorithm based on the divide and conquer technique. It is one of the most respected algorithms in data structures. One interesting thing to note about merge sort is that all its time complexities i.e Best, Worst and Average case is:
→Ο(n log n)