Project-2 (Analysis of Algorithms-2, ITU)

Implementation of Karatsuba Algorithm, a divide-and-conquer based multiplication operation. Coded in C++. Karatsuba method reduces the complexity of multiplication from O(n²) to O(n^log₂3) ≈ O(n^1.58). However, due to the complex design of the program, Karatsuba, at least in this project, runs slower than the regular multiplication.