2-butterfly derangement — The hallmark of the Cooley-Tukey algorithm for Fast Fourier Transform is the butterfly network, which helps reduce $O(n^2)$ computations to $O(n log n)$. Butterflies are