divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in P and NP, and approximation algorithms.

Karatsuba’s “divide-and-conquer” multiplication algorithm has its roots in a method that Carl Friedrich Gauss (1777-1855) introduced involving the multiplication of complex numbers.