Divide and conquer, a pretty common phrase, but why is this idea of social settings relevant to computer science algorithms? Turns out this is an efficient practice to quickly solve problems. We integrate this idea into our algorithms.
Generally, another approach of solving problems called Dynamic Programming is considered part of Recursion, so much so it is called "recursion with memory", but an important distinction shall be made here, i.e. DP is not divide and conquer, crucially the important steps divide and combine of DC are not involved in DP. Hence, it should be noted that DP, recursion and Dc are all different concepts. DC divides and solves subproblems, later combining them for larger solution. Recursion is a method that allows recursively solving subproblems. DP is an optimization method used to efficiently solve recusrsion when subproblems are ovelapping.
To be Updated