The beauty of computational efficiency: The Fast Fourier Transform.

Posted on Sat 02 July 2016 in computation • Tagged with python, programming, computation, efficiency, fft

When we discuss "computational efficiency", you often hear people throw around phrases like $O(n^2)$ or $O(nlogn)$. We talk about them in the abstract, and it can be hard to appreciate what these distinctions mean and how important they are. So let's take a quick look at what computational efficiency looks like in the context of a very famous algorithm: The Fourier Transform.

Continue reading