Algorithm Techniques – Divide et Impera (Divide and Conquer)

A typical Divide and Conquer algorithm solves a problem through three steps:

  1. Divide: Break the problem into sub-problems of the same type
  2. Conquer: Solve the sub-problems recursively[1]
  3. Combine: Combine the answers

[1] Recursion: A function that is calling itself, input parameters will most likely change in each call.

You may also like...