Multiplying polynomials in O(n log n)

This time we wandered in Computer Science land.

We first reviewed the basics of O(*) notation for algorithmic complexity and the gist of Divide and Conquer algorithms.

We used these basics to see how an algorithm can be sped up with a smart approach, and then things took an unexpected turn when Maths came into play.

And did I mention we've also implemented FFT without knowing?

Here are the slides of the presentation.

The presentation can be viewed on youtube at: