A very popular algorithmic paradigm, a typical Divide and Conquer algorithm solves a problem using following three steps:

• Divide: Break the given problem into subproblems of same type.

• Conquer: Recursively solve these subproblems

• Combine: Appropriately combine the answers