Divide and conquer

Home > Computer Science > Algorithms and data structures > Algorithm design > Divide and conquer

A technique in which a problem is broken down into smaller sub-problems, which are then solved independently and combined to form the solution to the original problem.