In this article I’ll be trying (really hard !! ) to explain in a simple manner a really famous sorting Algorithm Drrrrrrrrrrrrrrrrrum-roll MERGE SORT. I have tried to keep it as simple as possible, without getting into technical details to help you understand the logic behind the algorithm.

What is Merge Sort ?

Merge Sort is a really cool sorting algorithm that uses the concept of divide and conquer to sort the given data in order of O(n*log n) in all the three cases, best average and worst. For those not familiar with the concept of time complexity, just understand its a really efficient…

Vibhu Upamanyu

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store