Polynomial Multiplication of O(n^1.585)

Introducing, the Karatsuba Algorithm.

Introduction

This is a small project created in order to fulfill the needs of IF2211 Strategi Algoritma course on ITB. This project contains an implementation of the Karatsuba Algorithm, which does polynomial multiplication in a theoretically faster execution time.

Compiling this project

For Windows users, run the compile.bat file, and for Linux users, run the compile.sh file.

Running this project

For Windows users, run the run.bat file, and for Linux users, run the run.sh file.