Too Long; Didn't Read
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 <strong>divide</strong> a into some parts then <strong>conquer</strong> or solve the parts and finally combine them. Thus we can solve a problem easily.