An introduction to the discrete Fourier transform and how one goes about computing it in price. We examine the radix-2 Cooley-Tukey algorithm for computing a DFT in O(N logN) computational complexity.