Divide and Conquer (Merge Sort)
▻https://hackernoon.com/divide-and-conquer-merge-sort-11c673470427?source=rss----3a8144eabfe3---
Divide and conquer is an algorithmic strategy works by breaking down a problem into two or more sub-problems of the same or related type, solving them and make an addition of the sub problems. Let make it clear. In divide and conquer technique we need to divide a problem into sub-problems , solving them recursively and combine the sub-problems. So we can assume that, to follow this strategy we need to divide a into some parts then conquer or solve the parts and finally combine them. Thus we can solve a problem easily.There are many algorithms those follow divide and conquer technique. Such as Recursive Binary Search, Merge Sort, Quick sort, Selection sort, Strassen’s Matrix Multiplication etc.I want to make a series in which I will discuss about some algorithms which follow divide and (...)
#algorithmic-strategy #merge-sort #divide-and-conquer #programming #learn-to-code