Posts tagged efficiency
- 02 July 2016
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.
Briefly, A Fourier Transform is used for uncovering the spectral information that is present in a signal. AKA, it tells us about oscillatory components in the signal, and has a wide range of uses in communications, signal processing, and even neuroscience analysis.