+Divide And Conquer is a powerful [algorithm design](/wiki/algorithm_design) paradigm that solves a problem by breaking it into smaller sub-problems of the same type. These sub-problems are solved independently, often using [recursion](/wiki/recursion), and their solutions are then combined to solve the original larger problem, gracefully managing complexity.
+## See also
+- [Dynamic Programming](/wiki/dynamic_programming)
+- [Greedy Algorithm](/wiki/greedy_algorithm)
+- [Sorting Algorithms](/wiki/sorting_algorithms)
... 1 more lines