Fourier Transform, Optical Computing, Free Space Optics.
formulae given above has a complexity O(N²), the Cooley-Tukey algorithm reduces it to O(N log N). For large values of N, i.e., when dealing with large arrays, this is a significant advantage. Another feature of this algorithm is that each of the smaller transforms requires less resource than the