Algorithm Techniques – Divide et Impera (Divide and Conquer)
A typical Divide and Conquer algorithm solves a problem through three steps:
- Divide: Break the problem into sub-problems of the same type
- Conquer: Solve the sub-problems recursively
- Combine: Combine the answers
 Recursion: A function that is calling itself, input parameters will most likely change in each call.