This blog introduces the reader to the Divide and Conquer strategy and discusses a versatile 3 step method that can be adapted to solve almost all the problems that fall under the category of Divide and Conquer. To explain the concept in detail, the blog will use — Merge Sort — an algorithm that every Computer Science student should understand well. The blog also explains how to code Merge Sort and covers the practical aspect by providing the reader with a well-commented Python code. In the end, it also provides a few practice questions with links to the solutions.


Shantanu Tripathi

Deep Learning, NLP, Software dev etc. | NYU | Former SDE Intern at Amazon , AWS | Former SDE at CodeNation | Occasionally Philosophical | Mostly technical :p

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